Sciweavers

ESA
2004
Springer
103views Algorithms» more  ESA 2004»
14 years 3 months ago
Improved Online Algorithms for Buffer Management in QoS Switches
We consider the following buffer management problem arising in QoS networks: packets with specified weights and deadlines arrive at a network switch and need to be forwarded so th...
Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tom&aac...
ESA
2004
Springer
85views Algorithms» more  ESA 2004»
14 years 3 months ago
Hardness and Approximation Results for Packing Steiner Trees
Joseph Cheriyan, Mohammad R. Salavatipour
ESA
2004
Springer
106views Algorithms» more  ESA 2004»
14 years 3 months ago
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects
The ability to represent and query continuously moving objects is important in many applications of spatio-temporal database systems. In this paper we develop data structures for ...
Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Y...
CIAC
2006
Springer
106views Algorithms» more  CIAC 2006»
14 years 3 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 3 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 3 months ago
Universal Relations and #P-Completeness
Hervé Fournier, Guillaume Malod
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
14 years 3 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 3 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 3 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 3 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...