119 search results - page 11 / 24 » Linear-Time Algorithms for Parametric Minimum Spanning Tree ... |
CIAC
2010
Springer
14 years 4 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...
PDCAT
2005
Springer
14 years 29 days ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
GECCO
2004
Springer
14 years 26 days ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
SODA
1994
ACM
13 years 8 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...