Sciweavers

Share
19 search results - page 2 / 4
» esa 2000
Sort
View
ESA
2000
Springer
110views Algorithms» more  ESA 2000»
10 years 6 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
84views Algorithms» more  ESA 2000»
10 years 6 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
141views Algorithms» more  ESA 2000»
10 years 6 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
112views Algorithms» more  ESA 2000»
10 years 6 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
110views Algorithms» more  ESA 2000»
10 years 6 months ago
Polygon Decomposition for Efficient Construction of Minkowski Sums
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...
Pankaj K. Agarwal, Eyal Flato, Dan Halperin
books