Sciweavers

69 search results - page 6 / 14
» esa 2009
Sort
View
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
14 years 2 months ago
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...
Christoph Dürr, Flavio Guiñez, Mart&ia...
ESA
2009
Springer
346views Algorithms» more  ESA 2009»
14 years 2 months ago
Hash, Displace, and Compress
A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m − 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ...
Djamal Belazzougui, Fabiano C. Botelho, Martin Die...
ESA
2009
Springer
104views Algorithms» more  ESA 2009»
14 years 7 days ago
Hyperbolic Dovetailing
A familiar quandary arises when there are several possible alternatives for the solution of a problem, but no way of knowing which, if any, are viable for a particular problem inst...
David G. Kirkpatrick
ESA
2009
Springer
106views Algorithms» more  ESA 2009»
14 years 2 months ago
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...
Markus Bläser, Christian Hoffmann
ESA
2009
Springer
130views Algorithms» more  ESA 2009»
14 years 2 months ago
On the Performance of Approximate Equilibria in Congestion Games
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
George Christodoulou, Elias Koutsoupias, Paul G. S...