How to learn an unknown environment. I: the rectilinear case
Journal of the ACM (JACM)
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
SIAM Journal on Computing
Computing the median with uncertainty
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On computing functions with uncertainty
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
On Some Tighter Inapproximability Results
On Some Tighter Inapproximability Results
An algorithm for the relative robust shortest path problem with interval data
An algorithm for the relative robust shortest path problem with interval data
Combinatorial optimization in system configuration design
Automation and Remote Control
| Hi-index | 0.00 |
We consider the problem of estimating the length of the shortest path from a vertex s to a vertex t in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Initially, for each edge e, the length of e is known only to lie within an interval [l"e,h"e]; the estimation algorithm can pay w"e to find the exact length of e. We study the problem of finding the cheapest set of edges such that, if exactly these edges are queried, the length of the shortest s-t path will be known, within an additive @k=0, an input parameter. An actual s-t path, whose true length exceeds that of the shortest s-t path by at most @k, will be obtained as well. The problem of finding a cheap set of edge queries is in neither NP nor co-NP unless NP = co-NP. We give positive and negative results for two special cases and for the general case, which we show is in @S"2.