Sciweavers

Share
ESA
2000
Springer
122views Algorithms» more  ESA 2000»
9 years 1 months ago
Minimum Depth Graph Embedding
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
Maurizio Pizzonia, Roberto Tamassia
ESA
2000
Springer
110views Algorithms» more  ESA 2000»
9 years 1 months ago
Maintaining a Minimum Spanning Tree Under Transient Node Failures
Given a 2-node connected, undirected graph G = (V, E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem o...
Enrico Nardelli, Guido Proietti, Peter Widmayer
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
9 years 1 months ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann
ESA
2000
Springer
141views Algorithms» more  ESA 2000»
9 years 1 months ago
Preemptive Scheduling with Rejection
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
Han Hoogeveen, Martin Skutella, Gerhard J. Woeging...
ESA
2000
Springer
84views Algorithms» more  ESA 2000»
9 years 1 months ago
On Representations of Algebraic-Geometric Codes for List Decoding
Abstract. We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this...
Venkatesan Guruswami, Madhu Sudan
ESA
2000
Springer
124views Algorithms» more  ESA 2000»
9 years 1 months ago
Higher Order Delaunay Triangulations
For a set P of points in the plane, we introduce a class of triangulations that is an extension of the Delaunay triangulation. Instead of requiring that for each triangle the circ...
Joachim Gudmundsson, Mikael Hammar, Marc J. van Kr...
ESA
2000
Springer
75views Algorithms» more  ESA 2000»
9 years 1 months ago
I/O-Efficient Well-Separated Pair Decomposition and Its Applications
Sathish Govindarajan, Tamás Lukovszki, Anil...
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
9 years 1 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
ESA
2000
Springer
90views Algorithms» more  ESA 2000»
9 years 1 months ago
Property Testing in Computational Geometry
Artur Czumaj, Christian Sohler, Martin Ziegler
ESA
2000
Springer
98views Algorithms» more  ESA 2000»
9 years 1 months ago
The Minimum Range Assignment Problem on Linear Radio Networks
Andrea E. F. Clementi, Afonso Ferreira, Paolo Penn...
books