272 search results - page 24 / 55 » An Approximation Algorithm for a Bottleneck Traveling Salesm... |
130
Voted
WADS
2005
Springer
15 years 9 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
128
Voted
DISOPT
2006
15 years 3 months ago
2006
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...
166
Voted
COR
2008
15 years 2 months ago
2008
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...
168
Voted
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
86
Voted
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer