License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2012.257
URN: urn:nbn:de:0030-drops-38648
URL: http://drops.dagstuhl.de/opus/volltexte/2012/3864/
Go to the corresponding Portal


Anand, Abhash ; Baswana, Surender ; Gupta, Manoj ; Sen, Sandeep

Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs

pdf-format:
Document 1.pdf (501 KB)


Abstract

We present a fully dynamic algorithm for maintaining approximate maximum weight matching in general weighted graphs. The algorithm maintains a matching M whose weight is at least 1/8 M^{*} where M^{*} is the weight of the maximum weight matching. The algorithm achieves an expected amortized O(log n log C) time per edge insertion or deletion, where C is the ratio of the weights of the highest weight edge to the smallest weight edge in the given graph.

BibTeX - Entry

@InProceedings{anand_et_al:LIPIcs:2012:3864,
  author =	{Abhash Anand and Surender Baswana and Manoj  Gupta and Sandeep  Sen},
  title =	{{Maintaining Approximate Maximum Weighted Matching in Fully  Dynamic Graphs}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) },
  pages =	{257--266},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-47-7},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{18},
  editor =	{Deepak D'Souza and Telikepalli Kavitha and Jaikumar Radhakrishnan},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3864},
  URN =		{urn:nbn:de:0030-drops-38648},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2012.257},
  annote =	{Keywords: Matching, Dynamic Algorithm, Graph Algorithm}
}

Keywords: Matching, Dynamic Algorithm, Graph Algorithm
Seminar: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)
Issue Date: 2012
Date of publication: 10.12.2012


DROPS-Home | Fulltext Search | Imprint Published by LZI