WAOA
2005
Springer
14 years 5 months ago
2005
Springer
WAOA
2005
Springer
14 years 5 months ago
2005
Springer
WAOA
2005
Springer
14 years 5 months ago
2005
Springer
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...
WAOA
2005
Springer
14 years 5 months ago
2005
Springer
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...
WAOA
2005
Springer
14 years 5 months ago
2005
Springer
WAOA
2005
Springer
14 years 5 months ago
2005
Springer
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...
WAOA
2005
Springer
14 years 5 months ago
2005
Springer
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...
WAOA
2005
Springer
14 years 5 months ago
2005
Springer
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...
WAOA
2005
Springer
14 years 5 months ago
2005
Springer
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...
WAOA
2005
Springer
14 years 5 months ago
2005
Springer
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 ...