4 search results - page 1 / 1 » Approximating Maximum Leaf Spanning Trees in Almost Linear T... |
76
Voted
JAL
1998
15 years 23 days ago
1998
116
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...
105
Voted
JCO
2010
14 years 11 months ago
2010
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
116
Voted
STOC
2003
ACM
16 years 1 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...