14 search results - page 3 / 3 » Improved Approximation Ratios for Traveling Salesperson Tour... |
APPROX
2000
Springer
13 years 11 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
TASE
2010
IEEE
13 years 2 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
ALGORITHMICA
2006
13 years 7 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...