Sciweavers

WADS
2007
Springer
165views Algorithms» more  WADS 2007»
15 years 10 months ago
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
Matthias Müller-Hannemann, Siamak Tazari
94
Voted
WADS
2007
Springer
105views Algorithms» more  WADS 2007»
15 years 10 months ago
Finding Small Holes
Jeff Erickson
WADS
2007
Springer
101views Algorithms» more  WADS 2007»
15 years 10 months ago
Edges and Switches, Tunnels and Bridges
Abstract. Edge casing is a well-known method to improve the readability of drawings of non-planar graphs. A cased drawing orders the edges of each edge crossing and interrupts the ...
David Eppstein, Marc J. van Kreveld, Elena Mumford...