212 search results - page 17 / 43 » Competitive Online Approximation of the Optimal Search Ratio |
IPL
2008
13 years 7 months ago
2008
We consider a server location problem with only one server to move. In this paper we assume that a request is given as a region and that the service can be done anywhere inside th...
APPROX
2000
Springer
13 years 12 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
ICALP
1991
Springer
13 years 11 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
MFCS
2001
Springer
14 years 2 days ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...