Search Sciweavers | Sciweavers

970 search results - page 39 / 194

» On encodings of spanning trees

147

click to vote

STOC
1994
ACM

97views Algorithms» more STOC 1994»

An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane

15 years 10 months ago

Download www.cs.uwaterloo.ca

Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...

Naveen Garg, Dorit S. Hochbaum

claim paper

Read More »

click to vote

WDAG
1990
Springer

62views Algorithms» more WDAG 1990»

Spanning Tree Construction for Nameless Networks

15 years 10 months ago

Download www-lipn.univ-paris13.fr

Ivan Lavallée, Christian Lavault

claim paper

Read More »

105

click to vote

GD
2006
Springer

83views Computer Graphics» more GD 2006»

Smoother Transitions Between Breadth-First-Spanning-Tree-Based Drawings

15 years 9 months ago

Download pages.cs.wisc.edu

Christopher Homan, Andrew Pavlo, Jonathan Schull

claim paper

Read More »

136

click to vote

ICALP
1997
Springer

79views Programming Languages» more ICALP 1997»

Improving Spanning Trees by Upgrading Nodes

15 years 9 months ago

Download www.ccs.neu.edu

Sven Oliver Krumke, Madhav V. Marathe, Hartmut Nol...

claim paper

Read More »

130

click to vote

ESA
2008
Springer

88views Algorithms» more ESA 2008»

Faster Swap Edge Computation in Minimum Diameter Spanning Trees

15 years 7 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers