On-Line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology

Authors:
Mordechai Shalom;Prudence W. H. Wong;Shmuel Zaks
Affiliations:
TelHai Academic College, Upper Galilee, Israel;Department of Computer Science, The University of Liverpool, Liverpool, UK;Department of Computer Science, Technion, Haifa, Israel
Venue:
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Year:
2009

Citing 11
Cited 0

The competitiveness of on-line assignments

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Online weighted matching

Journal of Algorithms
Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs

Theoretical Computer Science
Minimizing ADMs on WDM directed fiber trees

Journal of Computer Science and Technology
A 10/7 + " Approximation for Minimizing the Number of ADMs in SONET Rings

BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Online budgeted matching in random input models with applications to Adwords

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On-line bipartite matching made simple

ACM SIGACT News
Better bounds for minimizing SONET ADMs

Journal of Computer and System Sciences
Optimal node routing

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Better bounds for minimizing SONET ADMs

WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Optimal on-line colorings for minimizing the number of ADMs in optical networks

DISC'07 Proceedings of the 21st international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the basic problems in optical networks is assigning wavelengths to (namely, coloring of) a given set of lightpaths so as to minimize the number of ADM switches. In this paper we present a connection between maximum matching in complete multipartite graphs and ADM minimization in star networks. A tight 2/3 competitive ratio for finding a maximum matching implies a tight 10/9 competitive ratio for finding a coloring that minimizes the number of ADMs.