Sciweavers

72 search results - page 4 / 15
» esa 2008
Sort
View
ESA
2008
Springer
92views Algorithms» more  ESA 2008»
14 years 11 months ago
How Reliable Are Practical Point-in-Polygon Strategies?
We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. Howeve...
Stefan Schirra
ESA
2008
Springer
73views Algorithms» more  ESA 2008»
14 years 11 months ago
On the Size of the 3D Visibility Skeleton: Experimental Results
Abstract. The 3D visibility skeleton is a data structure used to encode global visibility information about a set of objects. Previous theoretical results have shown that for k con...
Linqiao Zhang, Hazel Everett, Sylvain Lazard, Chri...
ESA
2008
Springer
127views Algorithms» more  ESA 2008»
14 years 11 months ago
The Alcuin Number of a Graph
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
Péter Csorba, Cor A. J. Hurkens, Gerhard J....
ESA
2008
Springer
101views Algorithms» more  ESA 2008»
14 years 11 months ago
Faster Steiner Tree Computation in Polynomial-Space
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
ESA
2008
Springer
96views Algorithms» more  ESA 2008»
14 years 11 months ago
The Partial Augment-Relabel Algorithm for the Maximum Flow Problem
Abstract. The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel...
Andrew V. Goldberg