12519 search results - page 450 / 2504 » Approximation Problems Categories |
173
click to vote
FOCS
2003
IEEE
16 years 5 days ago
2003
IEEE
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...
162
click to vote
DM
2008
15 years 7 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
142
click to vote
TCS
2008
15 years 6 months ago
2008
We study open-shop scheduling problems with job release times. The objective is to minimize the makespan. Dense schedules, easy to construct, are often used as approximate solutio...
219
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
160
click to vote
ICRA
2006
IEEE
16 years 28 days ago
2006
IEEE
— We consider the problem of path planning above a polyhedral terrain and present a new algorithm that for any p ≥ 1, computes a (c + ε)-approximation to the Lp-shortest path ...