120
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
153
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
122
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
ESA
2006
Springer
15 years 6 months ago
2006
Springer
123
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...