Sciweavers

10 search results - page 1 / 2
» waoa 2010
Sort
View
WAOA
2010
Springer
275views Algorithms» more  WAOA 2010»
13 years 2 months ago
Online Ranking for Tournament Graphs
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
Claire Mathieu, Adrian Vladu
WAOA
2010
Springer
237views Algorithms» more  WAOA 2010»
13 years 2 months ago
Lower Bounds for Smith's Rule in Stochastic Machine Scheduling
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...
Caroline Jagtenberg, Uwe Schwiegelshohn, Marc Uetz
WAOA
2010
Springer
251views Algorithms» more  WAOA 2010»
13 years 2 months ago
How to Play Unique Games on Expanders
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...
Konstantin Makarychev, Yury Makarychev
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
13 years 2 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
WAOA
2010
Springer
264views Algorithms» more  WAOA 2010»
13 years 2 months ago
An FPTAS for Flows over Time with Aggregate Arc Capacities
We study flows over time in networks with transit times on the arcs. Transit times describe how long it takes to traverse an arc. A flow over time specifies for each arc a time-dep...
Daniel Dressler, Martin Skutella