On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology-Reference-Cited by-同舟云学术

On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology

Published:2010 Issue: Volume: Page:281-294
ISSN:0302-9743
Container-title:Structural Information and Communication Complexity
language:
Short-container-title:

Author:

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

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-11476-2_22

Reference17 articles.

1. Azar, Y., Chaiutin, Y.: Optimal node routing. In: The proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 2006, pp. 596–607 (2006)

2. Azar, Y., Naor, J(S.), Rom, R.: The competitiveness of on-line assignments. In: The proceedings of the 13th SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, January 2002, pp. 203–210 (2002)

3. Azar, Y., Richter, Y.: Management of multi-queue switches in QoS networks. Algorithmica 43(1-2), 81–96 (2005)

4. Birnbaum, B., Mathieu, C.: On-line bipartite matching made simple. SIGACT News 39(1), 80–87 (2008)

5. Călinescu, G., Wan, P.-J.: Traffic partition in WDM/SONET rings to minimize SONET ADMs. Journal of Combinatorial Optimization 6(4), 425–453 (2002)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Scalable Feature Matching Across Large Data Collections;Journal of Computational and Graphical Statistics;2022-06-02

2. On-line maximum matching in complete multi-partite graphs with an application to optical networks;Discrete Applied Mathematics;2016-01