Sciweavers

36 search results - page 5 / 8
» wads 2007
Sort
View
WADS
2007
Springer
89views Algorithms» more  WADS 2007»
14 years 2 months ago
Dynamic TCP Acknowledgment with Sliding Window
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
Hisashi Koga
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
14 years 2 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
WADS
2007
Springer
195views Algorithms» more  WADS 2007»
14 years 2 months ago
Approximation Algorithms for the Sex-Equal Stable Marriage Problem
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
WADS
2007
Springer
131views Algorithms» more  WADS 2007»
14 years 2 months ago
On the Robustness of Graham's Algorithm for Online Scheduling
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
Michael Gatto, Peter Widmayer
WADS
2007
Springer
156views Algorithms» more  WADS 2007»
14 years 2 months ago
Cuttings for Disks and Axis-Aligned Rectangles
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...
Eynat Rafalin, Diane L. Souvaine, Csaba D. T&oacut...