279 search results - page 7 / 56 » Reduction approaches for robust shortest path problems |
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
JCO
2002
14 years 9 months ago
2002
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
104
click to vote
FOCS
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
108
Voted
W2GIS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
166
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...