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

DOI10.1007/978-3-642-11476-2_22MaRDI QIDQ3408178zbMATH OpenOpenAlexFDO

Authors Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks

Publication date 24 February 2010

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11476-2_22

zbMATH Keywords

optical networksadd-drop multiplexer (ADM)wavelength division multiplexing (WDM)wavelength assignmentonline matchingmulti-partite graphs

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On-line maximum matching in complete multi-partite graphs with an application to optical networks
• Optimal on-line colorings for minimizing the number of ADMs in optical networks
• Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
• Traffic Grooming in Star Networks via Matching Techniques
• scientific article; zbMATH DE number 2080982

Cites work

• {{#invoke:WikidataIB|getLink|Q3579420}} scientific article; zbMATH DE number 5764830 (Why is no real title available?)
• {{#invoke:WikidataIB|getLink|Q4763408}} scientific article; zbMATH DE number 742966 (Why is no real title available?)
• {{#invoke:WikidataIB|getLink|Q5713444}} Approximation and Online Algorithms
• {{#invoke:WikidataIB|getLink|Q1004601}} Better bounds for minimizing SONET ADMs
• {{#invoke:WikidataIB|getLink|Q5896813}} Management of multi-queue switches in QoS networks
• {{#invoke:WikidataIB|getLink|Q1884302}} Minimizing ADMs on WDM directed fiber trees
• {{#invoke:WikidataIB|getLink|Q4696653}} Online Weighted Matching
• {{#invoke:WikidataIB|getLink|Q5449834}} Optimal Node Routing
• {{#invoke:WikidataIB|getLink|Q3523227}} Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
• {{#invoke:WikidataIB|getLink|Q1810863}} Traffic partition in WDM/SONET rings to minimize SONET ADMs

Cited in

(1)

• On-line maximum matching in complete multi-partite graphs with an application to optical networks

This page was built for publication: On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408178)