534 search results - page 9 / 107 » Tight approximation algorithm for connectivity augmentation ... |
APPROX
2006
Springer
15 years 1 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...
SAC
2003
ACM
15 years 2 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
103
click to vote
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
103
click to vote
ALGORITHMICA
1998
14 years 9 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
CCCG
2010
14 years 11 months ago
2010
The cluster connecting problem inside a simple polygon is introduced in this paper. The problem is shown to be NP-complete. A log n-factor approximation algorithm is proposed.