Sciweavers

LATIN
2010
Springer
13 years 8 months ago
The Interval Constrained 3-Coloring Problem
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...
Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanit&a...
LATIN
2010
Springer
13 years 8 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen
LATIN
2010
Springer
13 years 8 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese
LATIN
2010
Springer
14 years 1 days ago
Complexity of Operations on Cofinite Languages
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...
Frédérique Bassino, Laura Giambruno,...
LATIN
2010
Springer
14 years 1 days ago
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
Eric Angel, Evripidis Bampis, Nicolas Thibault
LATIN
2010
Springer
14 years 2 days ago
Lightweight Data Indexing and Compression in External Memory
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...
Paolo Ferragina, Travis Gagie, Giovanni Manzini
LATIN
2010
Springer
14 years 1 months ago
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
LATIN
2010
Springer
14 years 3 months ago
Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight
Consider a dark polygonal region in which intruders move freely, trying to avoid detection. A robot, which is equipped with a flashlight, moves along the polygon boundary to illum...
Tsunehiko Kameda, Ichiro Suzuki, John Z. Zhang
LATIN
2010
Springer
14 years 3 months ago
Faithful Representations of Graphs by Islands in the Extended Grid
Michael D. Coury, Pavol Hell, Jan Kratochví...