ESA 2007 - PDF Preprint Papers

ESA 2007 European Symposium on Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ESA-2007 Paper

click to vote

ESA
2007
Springer

188views Algorithms» more ESA 2007»

Fast and Compact Oracles for Approximate Distances in Planar Graphs

14 years 5 months ago

Download www.diku.dk

We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...

Laurent Flindt Muller, Martin Zachariasen

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	188	Fast and Compact Oracles for Approximate Distances in Planar Graphs	claim
2	176	Arrangements in Geometry: Recent Advances and Challenges	claim
3	155	Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics	claim
4	153	Tradeoffs and Average-Case Equilibria in Selfish Routing	claim
5	150	On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems	claim
6	143	Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems	claim
7	140	On Minimum Power Connectivity Problems	claim
8	133	Order Statistics in the Farey Sequences in Sublinear Time	claim
9	131	Online Scheduling of Equal-Length Jobs on Parallel Machines	claim
10	130	Convex Combinations of Single Source Unsplittable Flows	claim
11	125	Pricing Tree Access Networks with Connected Backbones	claim
12	125	Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue	claim
13	122	A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem	claim
14	121	Equitable Revisited	claim
15	121	Finding Frequent Elements in Non-bursty Streams	claim
16	120	Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation	claim
17	118	A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks	claim
18	118	A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs	claim
19	117	Estimating Clustering Indexes in Data Streams	claim
20	117	Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation	claim
21	115	Approximation of Partial Capacitated Vertex Cover	claim
22	115	Good Quality Virtual Realization of Unit Ball Graphs	claim
23	113	Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step	claim
24	113	Distance Coloring	claim
25	110	An Experimental Study of New and Known Online Packet Buffering Algorithms	claim
26	108	Optimal Resilient Dynamic Dictionaries	claim
27	105	Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough	claim
28	105	Finding Branch-Decompositions and Rank-Decompositions	claim
29	105	Finding Mobile Data: Efficiency vs. Location Inaccuracy	claim
30	101	Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra	claim
31	100	Radix Sorting with No Extra Space	claim
32	100	Nash Equilibria in Voronoi Games on Graphs	claim
33	99	Solutions to Real-World Instances of PSPACE-Complete Stacking	claim
34	99	Linear-Time Ranking of Permutations	claim
35	97	To Fill or Not to Fill: The Gas Station Problem	claim
36	93	Polynomial Time Algorithms for Minimum Energy Scheduling	claim
37	92	Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation	claim
38	89	Bundle Pricing with Comparable Items	claim
39	81	Farthest-Polygon Voronoi Diagrams	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers