Sciweavers

ESA
2009
Springer
112views Algorithms» more  ESA 2009»
14 years 6 months ago
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
Johan M. M. van Rooij, Hans L. Bodlaender, Peter R...
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
14 years 6 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
ESA
2009
Springer
142views Algorithms» more  ESA 2009»
14 years 6 months ago
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
Andreas Karrenbauer, Thomas Rothvoß
ESA
2009
Springer
130views Algorithms» more  ESA 2009»
14 years 6 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...
ESA
2009
Springer
74views Algorithms» more  ESA 2009»
14 years 6 months ago
On Inducing Polygons and Related Problems
Bose et al. [2] asked whether for every simple arrangement A of n lines in the plane there exists a simple n-gon P that induces A by extending every edge of P into a line. We prov...
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc ...
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
14 years 6 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer
ESA
2009
Springer
120views Algorithms» more  ESA 2009»
14 years 6 months ago
Rank-Pairing Heaps
Abstract. We introduce the rank-pairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pair...
Bernhard Haeupler, Siddhartha Sen, Robert Endre Ta...
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
14 years 6 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
ESA
2009
Springer
130views Algorithms» more  ESA 2009»
14 years 6 months ago
Cauchy's Theorem for Orthogonal Polyhedra of Genus 0
A famous theorem by Cauchy states that a convex polyhedron is determined by its incidence structure and face-polygons alone. In this paper, we prove the same for orthogonal polyhe...
Therese C. Biedl, Burkay Genc
ESA
2009
Springer
106views Algorithms» more  ESA 2009»
14 years 6 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