Sciweavers

Share
WAOA
2005
Springer
90views Algorithms» more  WAOA 2005»
9 years 25 days ago
Approximation Schemes for Packing with Item Fragmentation
Hadas Shachnai, Tami Tamir, Omer Yehezkely
WAOA
2005
Springer
89views Algorithms» more  WAOA 2005»
9 years 25 days ago
Speed Scaling of Tasks with Precedence Constraints
Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
9 years 25 days ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke
WAOA
2005
Springer
104views Algorithms» more  WAOA 2005»
9 years 25 days ago
The Online Target Date Assignment Problem
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
Stefan Heinz, Sven Oliver Krumke, Nicole Megow, J&...
WAOA
2005
Springer
77views Algorithms» more  WAOA 2005»
9 years 25 days ago
Deterministic Online Optical Call Admission Revisited
Elisabeth Gassner, Sven Oliver Krumke
WAOA
2005
Springer
152views Algorithms» more  WAOA 2005»
9 years 25 days ago
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. ...
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
9 years 25 days ago
The Conference Call Search Problem in Wireless Networks
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...
Leah Epstein, Asaf Levin
WAOA
2005
Springer
86views Algorithms» more  WAOA 2005»
9 years 25 days ago
SONET ADMs Minimization with Divisible Paths
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic...
Leah Epstein, Asaf Levin
WAOA
2005
Springer
84views Algorithms» more  WAOA 2005»
9 years 25 days ago
A Note on Semi-online Machine Covering
In the machine cover problem we are given m machines and n jobs to be assigned (scheduled) so that the smallest load of a machine is as large as possible. A semi-online algorithm i...
Tomás Ebenlendr, John Noga, Jiri Sgall, Ger...
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
9 years 25 days ago
Rounding of Sequences and Matrices, with Applications
Abstract. We show that any real matrix can be rounded to an integer matrix in such a way that the rounding errors of all row sums are less than one, and the rounding errors of all ...
Benjamin Doerr, Tobias Friedrich, Christian Klein,...
books