Sciweavers

CIAC
2006
Springer
106views Algorithms» more  CIAC 2006»
14 years 4 months ago
On the Hardness of Range Assignment Problems
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
Bernhard Fuchs
CIAC
2006
Springer
75views Algorithms» more  CIAC 2006»
14 years 4 months ago
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
CIAC
2006
Springer
76views Algorithms» more  CIAC 2006»
14 years 4 months ago
Universal Relations and #P-Completeness
Hervé Fournier, Guillaume Malod
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
14 years 4 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
CIAC
2006
Springer
110views Algorithms» more  CIAC 2006»
14 years 4 months ago
Distance Approximating Trees: Complexity and Algorithms
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
Feodor F. Dragan, Chenyu Yan
CIAC
2006
Springer
111views Algorithms» more  CIAC 2006»
14 years 4 months ago
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
CIAC
2006
Springer
100views Algorithms» more  CIAC 2006»
14 years 4 months ago
Distributed Approximation Algorithms for Planar Graphs
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...
CIAC
2006
Springer
125views Algorithms» more  CIAC 2006»
14 years 4 months ago
On the Minimum Common Integer Partition Problem
Xin Chen, Lan Liu, Zheng Liu, Tao Jiang
CIAC
2006
Springer
135views Algorithms» more  CIAC 2006»
14 years 4 months ago
Approximation Algorithms for Capacitated Rectangle Stabbing
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Dror Rawitz, Shimon Shahar
CIAC
2006
Springer
84views Algorithms» more  CIAC 2006»
14 years 4 months ago
In-Place Randomized Slope Selection
Slope selection is a well-known algorithmic tool used in the context of computing robust estimators for fitting a line to a collection P of n points in the plane. We demonstrate th...
Henrik Blunck, Jan Vahrenhold