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

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 531-540

  Bartal, Yair ^a   Fiat, Amos ^b   Leonardi, Stefano ^a,c  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; TIMING CIRCUITS; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; ONLINE SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES;

COMPETITIVE RATIO; EDGE-DISJOINT PATHS; GENERAL NETWORKS; INAPPROXIMABILITY; INDUCED SUBGRAPHS; ON-LINE ALGORITHMS; RANDOMIZED ALGORITHMS; VIRTUAL CIRCUIT ROUTING;

GRAPH THEORY; ALGORITHMS;

LOWER BOUNDS; ONLINE CIRCUIT ROUTING; ONLINE GRAPH PROBLEMS; ONLINE PATH COLORING PROBLEMS; OPTICAL ROUTING;

EID: 0029701337     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.238001     Document Type: Conference Paper

References (21)

1. A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswani, B. Schieber and M. Sudan. Efficient Routing and Scheduling Algorithms for Optical Networks. In Proc. of the 5th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 412-423, 1994.
2. B. Awerbuch, Y. Azar and S. Plotkin. Throughput Competitive On-line Routing. In Proc. of the 34th Annual Symp. on Foundations of Computer Science, November 1993.
3. B. Awerbuch, Y. Bartal, A. Fiat and A. Rosen. Competitive Non-preemptive Call Control. In Proc. of 5th ACM-SIAM Symp. on Discrete Algorithms, 1994.
4. B. Awerbuch, R. Gawlick, F. T. Leighton and Y. Rabani. On-line Admission Control and Circuit Routing for High Performance Computing and Communication. In Proc. of the 35th Annual Syrnp. on Foundations of Computer Science, 1994.
5. R. B. Boppana and M. M. Halldorson. Approximating maximum independent set by excluding subgraphs. BIT 32(2), pp. 180-196, 1992.
6. R. A. Barry and P. A. Humblet. On the Number of Wavelengths and Switches in All Optical Networks. IEEE Trans. Comm., 1993.
7. J. Garay and I. S. Gopal. Call Preemption in Communications Networks, Proc. INFOCOM 92, Florence, Italy, pp. 1043-1050, 1992.
8. J. Garay, I. S. Gopal, S. Kutten, Y. Mansour and M. Yung. Efficient On-line Call Control Algorithms. In Proc. 2nd Israel Symp. on Theory of Computing and Systems, pages 285-293, June 1993.
9. M. M. Halldorsson. Approximation via partitioning. Manuscript, 1994.
10. M. M. Halldorsson and M. Szegedy. Lower Bounds for On-Line Graph Coloring. In Proc. of the 3rd Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 211-216, January 1992.
11. S. Irani. Coloring Inductive Graphs On-Line. In Proc. of the 31st Ann. IEEE Symp. on Foundations of Computer Science, pages 470-479, October 1990.
12. V. Kapoulas and P. Spirakis. Randomized Competitive Algorithms for Admission Control in General Networks. In Proc. of the 15th ACM Principle of Distributed Computing, pp. 253, August 1995.
13. R. M. Karp, U. V. Vazirani and V. V. Vazirani. An Optimal Algorithm for On-Line Bipartite Matching. In Proc. of the 22nd Ann. ACM Symp. on Theory of Computing, pages 352-358, May 1990.
14. J. Kleinberg and E. Tardos. Disjoint Paths in Densely Embedded Graphs. Proc of the 36-th IEEE Annual Symp. on Foundations of Computer Science, 1995.
15. C. Lund and M. Yannakakis. The Approximation of Maximum Subgraph Problems. In Proc. of the 20th International Colloquium on Automata, Languages and Programming, pp. 40-51, July 1993.
16. C. Lund and M. Yannakakis. On the Hardness of Approximating Minimization Problems. In Proc. of the 25th ACM Symp. on Theory of Computing, 1993.
17. R. K. Pankay. Architectures for Linear Light-wave Networks. PhD thesis, MIT, 1992.
18. P. Raghavan and U. Upfal. Efficient Routing in All-Optical Networks. In Proc. of the 26th Annual Symp. on Theory of Computing, pages 133-143, 1994.
19. D. Sleator and R. E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of ACM 28, 1985.
20. S. Vishwanathan. Randomized On-line Graph Coloring, In Proc. of the 31st IEEE Annual Symp. on Foundations of Computer Science, pp. 464-469, 1990.
21. A. C. Yao. Probabilistic Computations: Towards a Unified Measure of Complexity. In Proc. of the 17th Annual Symp. on Foundations of Computer Science, pp. 222-227, 1977.