Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing

@inproceedings{Bartal1996LowerBF,
  title={Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing},
  author={Yair Bartal and Amos Fiat and Stefano Leonardi},
  booktitle={STOC},
  year={1996}
}
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 r. E.g., independent set, planar, acyclic, bipartite, etc. We consider the on-line version of this family of… CONTINUE READING

Similar Papers

Loading similar papers…