Yair Bartal, Amos Fiat, Stefano Leonardi  Home/Search
Context Related
| dis.uniroma1.it/pub/Theo...tr006.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dis.uniroma1.it...replist_by_year (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present lower bounds on the competitive ratio of randomized algorithms for a wide class of on-line graph optimization problems and we apply such results to on-line virtual circuit and optical routing problems. (Update)
Similar documents based on text: More All
1.9: Lower Bounds for On-line Graph Problems with Application.. - Bartal, Fiat, Leonardi (1996) (Correct)
0.6: Randomized Lower Bounds for Online Path Coloring - Leonardi, Vitaletti (1998) (Correct)
0.4: On-line Competitive Algorithms for Call Admission.. - Awerbuch, Azar.. (1996) (Correct)
BibTeX entry: (Update)
Y. Bartal, A. Fiat, and S. Leonardi. Lower bounds for on-line graph problems with application to on-line circuit and optical routing. In Proc. 28th ACM Symposium on Theory of Computing, pages 531--540, 1996. http://citeseer.ist.psu.edu/bartal96lower.html More
@inproceedings{ bartal96lower,
author = "Yair Bartal and Amos Fiat and Stefano Leonardi",
title = "Lower bounds for on-line graph problems with application to on-line circuit and optical routing",
pages = "531--540",
year = "1996",
url = "citeseer.ist.psu.edu/bartal96lower.html" }
Citations (may not include all citations):488 Amortized Efficiency of List Update and Paging Rules (context) - Sleator, Tarjan - 1985
300 the Hardness of Approximating Minimization Problems (context) - Lund, Yannakakis - 1993
152 Probabilistic Computations: Towards a Unified Measure of Com.. (context) - Yao - 1977
133 Throughput Competitive On-line Routing - Awerbuch, Azar et al. - 1993
118 Competitive Non-preemptive Call Control - Awerbuch, Bartal et al. - 1994
104 Approximating maximum independent set by excluding subgraphs - Boppana, Halldorson - 1992
89 Efficient Routing in All-Optical Networks - Raghavan, Upfal - 1994
80 Efficient Routing and Scheduling Algorithms for Optical Netw.. - Aggarwal, Bar-Noy et al. - 1994
72 Disjoint Paths in Densely Embedded Graphs - Kleinberg, Tardos - 1995
72 line Admission Control and Circuit Routing for High Performa.. - Awerbuch, Gawlick et al. - 1994
62 Efficient On-line Call Control Algorithms - Garay, Gopal et al. - 1993
58 An Optimal Algorithm for On-Line Bipartite Matching (context) - Karp, Vazirani et al. - 1990
54 Call Preemption in Communications Networks (context) - Garay, Gopal - 1992
40 The Approximation of Maximum Subgraph Problems (context) - Lund, Yannakakis - 1993
36 the Number of Wavelengths and Switches in All Optical Networ.. - Barry, Humblet - 1993
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.dis.uniroma1.it/~alcom-it/AlcomArchive/replist_by_year.html): More
An Improved Linear Time Algorithm for Minimal Elimination.. - Dahlhaus (Correct)
A Hierarchical Adaptive Distributed Algorithm for.. - Antonis.. (Correct)
Dynamically Switching Vertices in Planar Graphs - Frigioni, Italiano (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC