Sciweavers

71 search results - page 9 / 15
» esas 2004
Sort
View
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
14 years 3 days ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
ESA
2004
Springer
128views Algorithms» more  ESA 2004»
14 years 3 days ago
Incremental Algorithms for Facility Location and k-Median
In the incremental versions of Facility Location and k-Median, the demand points arrive one at a time and the algorithm must maintain a good solution by either adding each new dema...
Dimitris Fotakis
ESA
2004
Springer
125views Algorithms» more  ESA 2004»
14 years 3 days ago
Approximation Algorithms for Quickest Spanning Tree Problems
Let G = (V, E) be an undirected multi-graph with a special vertex root ∈ V , and where each edge e ∈ E is endowed with a length l(e) ≥ 0 and a capacity c(e) > 0. For a pa...
Refael Hassin, Asaf Levin
ESA
2004
Springer
132views Algorithms» more  ESA 2004»
14 years 3 days ago
Seeking a Vertex of the Planar Matching Polytope in NC
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
Raghav Kulkarni, Meena Mahajan
ESA
2004
Springer
119views Algorithms» more  ESA 2004»
14 years 3 days ago
A Straight Skeleton Approximating the Medial Axis
We propose the linear axis, a new skeleton for polygonal shapes. It is related to the medial axis and the straight skeleton, being the result of a wavefront propagation process. Th...
Mirela Tanase, Remco C. Veltkamp