752 search results - page 40 / 151 » Faster approximation algorithms for the minimum latency prob... |
125
click to vote
WADS
2005
Springer
15 years 6 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
146
click to vote
SWAT
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
106
click to vote
CAIP
2005
Springer
15 years 6 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The c...
108
click to vote
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
130
click to vote
NETWORKS
2002
15 years 26 days ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...