105 search results - page 16 / 21 » A 3-Approximation for the Minimum Tree Spanning k Vertices |
150
click to vote
FOCS
2004
IEEE
15 years 9 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
121
click to vote
JGT
2008
15 years 6 months ago
2008
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number (G) is th...
157
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
187
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
179
click to vote
APPROX
2007
Springer
16 years 7 days ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...