WAOA
2010
Springer
13 years 10 months ago
2010
Springer
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...
WAOA
2010
Springer
13 years 10 months ago
2010
Springer
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 ...
WAOA
2010
Springer
13 years 10 months ago
2010
Springer
We consider cut games where players want to cut themselves off from different parts of a network. These games arise when players want to secure themselves from areas of potential i...
WAOA
2010
Springer
13 years 10 months ago
2010
Springer
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...
WAOA
2010
Springer
13 years 10 months ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
WAOA
2010
Springer
13 years 10 months ago
2010
Springer
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...
WAOA
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
WAOA
2010
Springer
13 years 10 months ago
2010
Springer
We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of i...
WAOA
2010
Springer
13 years 10 months ago
2010
Springer
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...
WAOA
2010
Springer
13 years 10 months ago
2010
Springer
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...