Lower bounds for on-line graph problems with application to on-line circuit and optical routing

Yair Bartal, Amos Fiat, Stefano Leonardi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

50 Scopus citations

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 online virtual circuit and optical routing problems. Lund and Yannakakis [LY93a] give inapproximability results for the problem of finding the largest vertex induced subgraph satisfying any non-trivial, hereditary, property π. E.g., independent set, planar, acyclic, bipartite, etc. We consider the on-line version of this family of problems, where some graph G is fixed and some subgraph H is presented on-line, vertex by vertex. The on-line algorithm must choose a subset of the vertices of H, choosing or rejecting a vertex when it is presented, whose vertex induced subgraph satisfies property π. Furthermore, we study the on-line version of graph coloring whose off-line version has also been shown to be inapproximable [LY93b], on-line max edgedisjoint paths and on-line path coloring problems. Irrespective of the time complexity, we show an Ω,(n) lower bound on the competitive ratio of randomized online algorithms for any of these problems. As a consequence, we obtain an Ω(n) lower bound on the competitive ratio of randomized on-line algorithms for virtual circuit routing on general networks, in contrast to the known results for some specific networks. Moreover, this lower bound holds even if the use of preemption is allowed. Similar lower bounds are obtained for on-line optical routing as well.

Original languageAmerican English
Title of host publicationProceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996
PublisherAssociation for Computing Machinery
Pages531-540
Number of pages10
ISBN (Electronic)0897917855
DOIs
StatePublished - 1 Jul 1996
Externally publishedYes
Event28th Annual ACM Symposium on Theory of Computing, STOC 1996 - Philadelphia, United States
Duration: 22 May 199624 May 1996

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
VolumePart F129452
ISSN (Print)0737-8017

Conference

Conference28th Annual ACM Symposium on Theory of Computing, STOC 1996
Country/TerritoryUnited States
CityPhiladelphia
Period22/05/9624/05/96

Bibliographical note

Publisher Copyright:
© 1996 ACM.

Fingerprint

Dive into the research topics of 'Lower bounds for on-line graph problems with application to on-line circuit and optical routing'. Together they form a unique fingerprint.

Cite this