Sciweavers

Share
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
10 years 15 days ago
The Multi-radius Cover Problem
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...
Refael Hassin, Danny Segev
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
10 years 15 days ago
Near-Optimal Pricing in Near-Linear Time
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
Jason D. Hartline, Vladlen Koltun
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
10 years 15 days ago
Parameterized Complexity of Generalized Vertex Cover Problems
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
WADS
2005
Springer
108views Algorithms» more  WADS 2005»
10 years 15 days ago
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Nie...
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
10 years 15 days ago
Improved Combinatorial Group Testing for Real-World Problem Sizes
We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which i...
David Eppstein, Michael T. Goodrich, Daniel S. Hir...
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
10 years 15 days ago
On Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar ...
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
10 years 15 days ago
Hinged Dissection of Polypolyhedra
This paper presents a general family of 3D hinged dissections for polypolyhedra, i.e., connected 3D solids formed by joining several rigid copies of the same polyhedron along iden...
Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lin...
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
10 years 15 days ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
10 years 15 days ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
10 years 15 days ago
Subquadratic Algorithms for 3SUM
We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with w-bit words, we obtain a running time of O(n2 / max{ w lg2 w , ...
Ilya Baran, Erik D. Demaine, Mihai Patrascu
books