On-line Network Optimization Problems

There has been a reasonable amount of work on on-line network optimization in the monotone model. Usually one first analyzes the greedy algorithm that lets Hi+1 be the cheapest extension of Hi. Some reasonable fraction of the time the greedy algorithm turns out to be close to optimal. Even if it isn't, the analysis usually provides good intuition for developing a better algorithm. Often this better algorithm is relatively a minor modification to greedy.

[1]  Yossi Azar,et al.  On-line generalized Steiner problem , 1996, SODA '96.

[2]  Leen Stougie,et al.  Competitive Algorithms for the On-line Traveling Salesman , 1995, WADS.

[3]  Bala Kalyanasundaram,et al.  Constructing Competitive Tours from Local Information , 1994, Theor. Comput. Sci..

[4]  Leen Stougie,et al.  Serving Requests with On-line Routing , 1994, SWAT.

[5]  Chuan Yi Tang,et al.  Average Performance of a Greedy Algorithm for the On-Line Minimum Matching Problem on Euclidean Space , 1994, Inf. Process. Lett..

[6]  Barun Chandra,et al.  Constructing Reliable Communication Networks of Small Weight Online , 1995, J. Algorithms.

[7]  Ming-Yang Kao,et al.  Online Matching with Blocked Input , 1991, Inf. Process. Lett..

[8]  Samir Khuller,et al.  On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages , 1991, Theor. Comput. Sci..

[9]  Piotr Berman,et al.  On-line algorithms for Steiner tree problems (extended abstract) , 1997, STOC '97.

[10]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[11]  Ming-Yang Kao,et al.  Online Perfect Matching and Mobile Computing , 1995, WADS.

[12]  Noga Alon,et al.  On-line steiner trees in the Euclidean plane , 1992, SCG '92.

[13]  Jeffery R. Westbrook,et al.  Linear Bounds for On-Line Steiner Problems , 1995, Inf. Process. Lett..

[14]  Bala Kalyanasundaram,et al.  A Competitive Analysis of Algorithms for Searching Unknown Scenes , 1993, Comput. Geom..

[15]  Ronald L. Graham,et al.  On the History of the Minimum Spanning Tree Problem , 1985, Annals of the History of Computing.

[16]  Jeffery R. Westbrook,et al.  Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems , 1993, WADS.

[17]  Yuval Rabani,et al.  Competitive algorithms for distributed data management (extended abstract) , 1992, STOC '92.

[18]  Bala Kalyanasundaram,et al.  An Optimal Deterministic Algorithm for Online b-Matching , 1996, FSTTCS.

[19]  Yuval Rabani,et al.  Competitive Algorithms for Distributed Data Management , 1995, J. Comput. Syst. Sci..

[20]  Bala Kalyanasundaram,et al.  Online Weighted Matching , 1993, J. Algorithms.

[21]  Makoto Imase,et al.  Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..