Sciweavers

69 search results - page 7 / 14
» esa 2009
Sort
View
ESA
2009
Springer
120views Algorithms» more  ESA 2009»
14 years 2 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
74views Algorithms» more  ESA 2009»
14 years 2 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
112views Algorithms» more  ESA 2009»
14 years 2 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
2010
Springer
220views Algorithms» more  ESA 2010»
13 years 8 months ago
Data Structures for Storing Small Sets in the Bitprobe Model
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
Jaikumar Radhakrishnan, Smit Shah 0001, Saswata Sh...
ESA
2009
Springer
167views Algorithms» more  ESA 2009»
14 years 7 days ago
Clustering-Based Bidding Languages for Sponsored Search
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
Mohammad Mahdian, Grant Wang