Sciweavers

STACS
2004
Springer
14 years 3 months ago
Lattices with Many Cycles Are Dense
Abstract We give a method for approximating any n-dimensional lattice with a lattice Λ whose factor group Zn /Λ has n − 1 cycles of equal length with arbitrary precision. We al...
Mårten Trolin
STACS
2004
Springer
14 years 3 months ago
Active Context-Free Games
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo ...
Anca Muscholl, Thomas Schwentick, Luc Segoufin
STACS
2004
Springer
14 years 3 months ago
Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, ...
STACS
2004
Springer
14 years 3 months ago
Optimal and Online Preemptive Scheduling on Uniformly Related Machines
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
Tomás Ebenlendr, Jiri Sgall
Theoretical Computer Science
Top of PageReset Settings