## Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing (1996)

### Cached

### Download Links

- [www.icsi.berkeley.edu]
- [www.dis.uniroma1.it]
- DBLP

### Other Repositories/Bibliography

Citations: | 55 - 11 self |

### BibTeX

@MISC{Bartal96lowerbounds,

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},

year = {1996}

}

### OpenURL

### 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. 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 edge-disjoint paths and on-line path coloring problems. Irrespective of the time complexity, w...

### Citations

768 |
Amortized efficiency of list update and paging rules
- Sleator, Tarjan
- 1985
(Show Context)
Citation Context ... listed below. For each such problem we first give the off-line version, and then give the on-line variant. The performance of an algorithm for an on-line problem is measured by its competitive ratio =-=[ST85]-=-. The competitive ratio for benefit problems is defined as the worst case ratio between the optimal off-line benefit and the on-line benefit. For cost problems the competitive ratio is defined as the ... |

703 | Online Computation and Competitive Analysis - Borodin, El-Yaniv - 1998 |

398 |
On the hardness of approximating minimization problems
- Lund, Yannakakis
- 1994
(Show Context)
Citation Context ...x 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 edge-disjoint paths and on-line path coloring problems. Irrespective of the time complexity, we show an Ω(n ǫ ) lower bound on the competitive ratio of randomized on-line algorithms for ... |

371 |
Probabilistic computations: Towards a unified measure of complexity
- Yao
- 1977
(Show Context)
Citation Context ...subproblem of routing in optical switchless networks — coloring version. 1.4 Structure of the paper In Section 2 we give formal definitions of competitive analysis and explain the use of Yao’s Lemma (=-=[Y77]-=-) for lower bounds for on-line randomized algorithms. Section 3 deals with the on-line induced subgraph problem. In Section 3.1 we present the lower bound for randomized non-preemptive algorithms for ... |

221 | Throughput competitive on-line routing
- Awerbuch, Azar, et al.
- 1993
(Show Context)
Citation Context ...ound, where µ is either the ratio between the maximum and the minimum duration, or the ratio between the maximum and the minimum benefit of a call. Non-preemptive call control was first considered in =-=[AAP93]-=-. They gave throughput competitive algorithms, O(log n) competitive, for arbitrary networks, (not requiring preemption), if every call request bandwidth was for no more than a logarithmic fraction of ... |

150 |
An optimal algorithm for on-line bipartite matching
- Karp, Vazirani, et al.
- 1990
(Show Context)
Citation Context ... On-line graph problems On-line graph optimization problems have been previously considered in several works: the problem of obtaining a maximal on-line matching in a bipartite graph is considered in =-=[KVV90]-=-, the on-line coloring of a three colorable graph is studied in [V90], the problem of coloring an inductive graph is studied in [I90], and randomized lower bounds for on-line graph coloring are given ... |

147 | On the power of randomization in on-line algorithms
- Ben-David, Borodin, et al.
- 1994
(Show Context)
Citation Context ..., for some ǫ > 0. This is fairly easy to show for deterministic algorithms, our main contribution is showing that this holds even for randomized on-line algorithms against an oblivious adversary (cf. =-=[BBKTW90]-=-) 1 . Our lower bounds for the on-line independent set and the on-line edge-disjoint paths problems also hold when in the context of benefit problems the use of preemption is allowed to the randomized... |

135 | Approximating maximum independent sets by excluding subgraphs, Bit 32
- Boppana, Halld'orsson
- 1992
(Show Context)
Citation Context ...+ OPT(I)) ≥ √ α 2n OPT. The current best known polynomial time algorithms have an approximation ratio of O( n log n ) for n the induced subgraph problem [Hal94], and O( (log n) 2) for independent set =-=[BH92]-=-. In particular, using the optimal (non-polynomial time) algorithm for the problem (e.g. α = n) we obtain: Corollary 21 There exists an O( √ n)-competitive randomized algorithm for the on-line induced... |

125 | Efficient routing all-optical networks - RAGHAVAN, UPFAL - 1994 |

112 | Competitive non-preemptive call control
- Awerbuch, Bartal, et al.
- 1994
(Show Context)
Citation Context ...c fraction of the minimal link capacity. They also prove an Ω(n) lower bound on the competitive ratio of deterministic on-line algorithms on general networks if calls may request arbitrary bandwidth. =-=[ABFR94]-=- considered randomized non-preemptive algorithms for call control, on tree networks, getting a competitive ratio of O(log n) when all edge capacities are 1, all bandwidth requests are 1, all durations... |

108 | On-line load balancing with applications to machine scheduling and virtual circuit routing - Aspnes, Azar, et al. - 1993 |

79 | EÆcient routing and scheduling algorithms for optical networks - Aggarwal, Bar-Noy, et al. - 1994 |

77 | Ecient on-line call control algorithms
- Garay, Gopal, et al.
- 1993
(Show Context)
Citation Context ...offering a given benefit. Each call can be either accepted and scheduled observing the bandwidth constraints on all links, or rejected. Following [GG92] we call this problem the Call Control problem. =-=[GGKMY93]-=- considered the call control problem when the algorithm is allowed to preempt previously accepted calls. They give deterministic preemptive algorithms with a competitive ratio of O(log n) for a line n... |

73 | On-line admission control and circuit routing for high-performance computing and communication
- Awerbuch, Gawlick, et al.
- 1994
(Show Context)
Citation Context ...lower bound for the call control problem. Similarly, an upper bound on the competitive ratio for edge-disjoint paths gives an upper bound on the more general problem using the techniques of [ABFR94]. =-=[AGLR94]-=- give a randomized call control algorithm for the mesh, with a competitive ratio of O(log 2 n) and a O(log D) competitive algorithm for trees, where D is the diameter of the tree. In a later paper, [K... |

65 | Disjoint path in densely embedded graphs
- Kleinberg
- 1995
(Show Context)
Citation Context ...4] give a randomized call control algorithm for the mesh, with a competitive ratio of O(log 2 n) and a O(log D) competitive algorithm for trees, where D is the diameter of the tree. In a later paper, =-=[KT95]-=- gave an O(log n) competitive randomized call control algorithm for the mesh and extended this result to more general “densely embedded nearly Euclidean” planar graphs. The issue of the variance of ra... |

63 | Competitive routing of virtual circuits with unknown duration - Awerbuch, Azar, et al. - 1994 |

62 | Approximation of weighted independent set and hereditary subset problems
- Halldorsson
- 1999
(Show Context)
Citation Context ... OPT(Ii) + 1) ≥ 2 (1 k √ α 2n (� k i=1 OPT(Ii) + OPT(I)) ≥ √ α 2n OPT. The current best known polynomial time algorithms have an approximation ratio of O( n log n ) for n the induced subgraph problem =-=[Hal94]-=-, and O( (log n) 2) for independent set [BH92]. In particular, using the optimal (non-polynomial time) algorithm for the problem (e.g. α = n) we obtain: Corollary 21 There exists an O( √ n)-competitiv... |

53 |
The approximation of maximum subgraph problems
- Lund, Yannakakis
- 1993
(Show Context)
Citation Context ...mpetitive 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. 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. We... |

49 | On-line competitive algorithms for call admission in optical networks - Awerbuch, Azar, et al. - 1996 |

45 | Coloring inductive graphs on-line
- Irani
- 1990
(Show Context)
Citation Context ...a maximal on-line matching in a bipartite graph is considered in [KVV90], the on-line coloring of a three colorable graph is studied in [V90], the problem of coloring an inductive graph is studied in =-=[I90]-=-, and randomized lower bounds for on-line graph coloring are given in [HS92]. In all the previous papers, vertices and/or edges arrive on-line, and the on-line algorithm has to make some relevant deci... |

43 | Bandwidth allocation with preemption - Bar-Noy, Canetti, et al. - 1995 |

33 | On-line routing in all-optical networks - Bartal, Leonardi - 1997 |

33 | On-line randomized call control revisited
- Leonardi, Marchetti-Spaccamela, et al.
- 1998
(Show Context)
Citation Context ...control algorithm for the mesh and extended this result to more general “densely embedded nearly Euclidean” planar graphs. The issue of the variance of randomized on-line algorithms was considered in =-=[LMPR98]-=-. The authors propose randomized on-line competitive algorithms for trees and meshes that achieve both optimal competitive ratio and produce a solution concentrated with good probability around the ex... |

26 |
Randomized online graph coloring
- Vishwanathan
- 1992
(Show Context)
Citation Context ...reviously considered in several works: the problem of obtaining a maximal on-line matching in a bipartite graph is considered in [KVV90], the on-line coloring of a three colorable graph is studied in =-=[V90]-=-, the problem of coloring an inductive graph is studied in [I90], and randomized lower bounds for on-line graph coloring are given in [HS92]. In all the previous papers, vertices and/or edges arrive o... |

23 | Lower bounds for on-line graph coloring
- Halldórsson, Szegedy
- 1994
(Show Context)
Citation Context ...he on-line coloring of a three colorable graph is studied in [V90], the problem of coloring an inductive graph is studied in [I90], and randomized lower bounds for on-line graph coloring are given in =-=[HS92]-=-. In all the previous papers, vertices and/or edges arrive on-line, and the on-line algorithm has to make some relevant decision when this happens. The adversary has total freedom to decide what graph... |

19 | Bouding the power of preemption in randomized scheduling
- Canetti, Irani
- 1995
(Show Context)
Citation Context ... a correct version of it. A correct version of the proof of Lemma 10, along slightly different lines from [KS98], is also presented in this paper. 3s� log µ algorithms for a single link were given in =-=[CI95]-=-. The authors show an Ω( log log µ ) lower bound, where µ is either the ratio between the maximum and the minimum duration, or the ratio between the maximum and the minimum benefit of a call. Non-pree... |

13 |
On randomization in online computations
- Borodin, El-Yaniv
- 1997
(Show Context)
Citation Context ... on the von Neumann minimax principle (see [Y77]) applied to on-line algorithms. We only need consider the case where the sequences are finite and the number of deterministic algorithms is finite. In =-=[BE97]-=- it is shown that in this case the following corollaries can be derived from Yao’s Lemma: Corollary 1 Given a cost problem, the following three statements are equivalent: 1. ρ is a lower bound on the ... |

13 | Approximation via partitioning - Halldórsson - 1995 |

5 | Randomized Competitive Algorithms for Admission Control in General Networks - Kapoulas, Spirakis - 1995 |

4 | On the number of wavelengths and switches in all optical networks - Barry, Humblet - 1993 |

3 | On-line complexity of monotone set systems
- Kaplan, Szegedy
- 1999
(Show Context)
Citation Context ...rithm for a single link and a line topology when the benefit of a call is proportional to the bandwidth duration product. Lower bounds for randomized preemptive 1 In a recent paper Kaplan and Szegedy =-=[KS98]-=- point out that the proof of a claim of the proceedings version of this paper [BFL96], corresponding to Lemma 10 in this paper, was not correct, and present a correct version of it. A correct version ... |

2 | O.Waarts. On-line load balancing of temporary tasks - Azar, Kalyanasundaram, et al. - 1993 |

2 | Architectures for Linear Light-wave Networks - Pankay - 1992 |