Sciweavers

Share
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
10 years 3 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
10 years 3 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
ESA
2005
Springer
162views Algorithms» more  ESA 2005»
10 years 4 months ago
Negative Cycle Detection Problem
In this paper, we will describe some heuristics that can be used to improve the runtime of a wide range of commonly used algorithms for the negative cycle detection problem signi...
Chi-Him Wong, Yiu-Cheong Tam
ESA
2005
Springer
103views Algorithms» more  ESA 2005»
10 years 4 months ago
Fairness-Free Periodic Scheduling with Vacations
Jiri Sgall, Hadas Shachnai, Tami Tamir
ESA
2005
Springer
155views Algorithms» more  ESA 2005»
10 years 4 months ago
Highway Hierarchies Hasten Exact Shortest Path Queries
We present a new speedup technique for route planning that exploits the hierarchy inherent in real world road networks. Our algorithm preprocesses the eight digit number of nodes n...
Peter Sanders, Dominik Schultes
ESA
2005
Springer
111views Algorithms» more  ESA 2005»
10 years 4 months ago
Delineating Boundaries for Imprecise Regions
In geographic information retrieval users use names of geographic regions that do not have a well-defined boundary, like Southern France. We present two approaches to compute rea...
Iris Reinbacher, Marc Benkert, Marc J. van Kreveld...
ESA
2005
Springer
93views Algorithms» more  ESA 2005»
10 years 4 months ago
New Tools and Simpler Algorithms for Branchwidth
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
Christophe Paul, Jan Arne Telle
ESA
2005
Springer
107views Algorithms» more  ESA 2005»
10 years 4 months ago
Workload-Optimal Histograms on Streams
Histograms are used in many ways in conventional databases and in data stream processing for summarizing massive data distributions. Previous work on constructing histograms on da...
S. Muthukrishnan, Martin Strauss, X. Zheng
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
10 years 4 months ago
Online View Maintenance Under a Response-Time Constraint
Abstract. A materialized view is a certain synopsis structure precomputed from one or more data sets (called base tables) in order to facilitate various queries on the data. When t...
Kamesh Munagala, Jun Yang 0001, Hai Yu
books