69 search results - page 4 / 14 » Improved Approximation Algorithms for Minimum Weight Vertex ... |
132
click to vote
ESA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
135
click to vote
IPL
1998
15 years 2 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
150
click to vote
COCOON
2004
Springer
15 years 7 months ago
2004
Springer
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
164
click to vote
FOCS
2003
IEEE
15 years 8 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 ...
138
click to vote
ESA
2001
Springer
15 years 7 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...