109 search results - page 12 / 22 » An Approximation Algorithm for Shortest Descending Paths |
121
click to vote
ISVC
2009
Springer
15 years 7 months ago
2009
Springer
Throughout history, the primary means of transportation for humans has been on foot. We present a software tool which can help visualize and predict where historical trails might l...
138
click to vote
IPCO
2004
15 years 2 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
128
click to vote
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...
104
click to vote
SIGECOM
2005
ACM
15 years 6 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
145
click to vote
IEEEMSP
2002
IEEE
15 years 6 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...