628 search results - page 23 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
135
click to vote
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
142
Voted
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
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...
130
click to vote
ESA
2000
Springer
15 years 6 months ago
2000
Springer
Given a 2-node connected, undirected graph G = (V, E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem o...
134
click to vote
NETWORKS
2008
15 years 2 months ago
2008
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...