Improved approximation guarantees for weighted matching in the semi-streaming model

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 5, Issue , 2010, Pages 347-358

  Epstein, Leah ^a   Levin, Asaf ^b   Mestre, Julián ^c   Segev, Danny ^a  

^a UNIVERSITY OF HAIFA   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITIVE RATIO; DETERMINISTIC ALGORITHMS; DETERMINISTIC APPROACH; FUTURE IMPROVEMENTS; MAXIMUM WEIGHT MATCHING; ON-LINE ALGORITHMS; PERFORMANCE GUARANTEES; WEIGHTED MATCHING;

COMPUTER SCIENCE;

ALGORITHMS;

EID: 84880307147     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2010.2476     Document Type: Conference Paper

References (17)

1. 2 k)-competitive algorithm for metric bipartite matching. In Proceedings of the 15th Annual European Symposium on Algorithms, pages 522-533, 2007.
2. M. Elkin and J. Zhang. Efficient algorithms for constructing (1 + ε,β)-spanners in the distributed and streaming models. Distributed Computing, 18(5):375-385, 2006.
3. L. Epstein, A. Levin, J. Mestre, and D. Segev. Improved approximation guarantees for weighted matching in the semi-streaming model, 2009. http://arxiv.org/abs/0907.0305.
4. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang. On graph problems in a semi-streaming model. Theoretical Computer Science, 348(2-3):207-216, 2005.
5. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang. Graph distances in the data-stream model. SIAM Journal on Computing, 38(5): 1709-1727, 2008.
6. J. A. Garay, I. S. Gopal, S. Kutten, Y. Mansour, and M. Yung. Efficient on-line call control algorithms. Journal of Algorithms, 23(1): 180-194, 1997.
7. B. Kalyanasundaram and K. Pruhs. Online weighted matching. Journal of Algorithms, 14(3):478-488, 1993.
8. M.-Y Kao, J. H. Reif, and S. R. Tate. Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. Information and Computation, 131(1):63-79, 1996.
9. R. M. Karp, U. V. Vazirani, and V. V. Vazirani. An optimal algorithm for on-line bipartite matching. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 352-358, 1990.
10. S. Khuller, S. G. Mitchell, and V. V. Vazirani. On-line algorithms for weighted bipartite matching and stable marriages. Theoretical Computer Science, 127(2):255-267, 1994.
11. J. Maue and P. Sanders. Engineering algorithms for approximate weighted matching. In Proceedings of the 6th International Workshop on Experimental Algorithms, pages 242-255, 2007.
12. A. McGregor. Finding graph matchings in data streams. In Proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pages 170-181, 2005.
13. M. Müller-Hannemann and A. Schwartz. Implementing weighted b-matching algorithms: Towards a flexible software design. ACM Journal on Experimental Algorithmics, 4:7, 1999.
14. S. Muthukrishnan. Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science. Now Publishers Inc, 2005.
15. G. Reinelt. TSPLIB. http://comopt.ifi.uni-heidelberg.de/software/ TSPLIB95/.
16. A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Springer, 2003.
17. M. Zelke. Weighted matching in the semi-streaming model. In Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science, pages 669-680, 2008.