4843 search results - page 306 / 969 » The Shortcut Problem - Complexity and Approximation |
127
click to vote
FOCS
2003
IEEE
15 years 9 months 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...
114
click to vote
DM
2008
15 years 4 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...
114
click to vote
TCS
2008
15 years 4 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...
122
click to vote
ICRA
2006
IEEE
15 years 10 months 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 ...
126
click to vote
AAAI
1993
15 years 5 months ago
1993
One of the hardest problems in reasoning about a physical system is finding an approximate model that is mathematically tractable and yet captures the essence of the problem. Appr...