EPrints@IIT Delhi >
Faculty Research Publicatons  >
Computer Science and Engineering >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/2347

Full metadata record

DC FieldValueLanguage
dc.contributor.authorKhuller, Samir-
dc.contributor.authorMitchell, Stephen G-
dc.contributor.authorVazirani, Vijay V-
dc.identifier.citationTheoretical Computer Science, 127(2 ), 255-267p.en
dc.description.abstractWe give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n−1) in any metric space (where n is the number of vertices). This algorithm is optimal - there is no on-line deterministic algorithm that achieves a competitive ratio better than (2n−1) in all metric spaces. We also study the stable marriage problem, where we are interested in the number of unstable pairs produced. We show that the simple “first come, first served” deterministic algorithm yields on the average O(n log n) unstable pairs, but in the worst case no deterministic or randomized on-line algorithm can do better than ω(n2) unstable pairs. This appears to be the first on-line problem for which provably one cannot do better with randomization; for most on-line problems studied in the past, randomization has helped in improving the performance.en
dc.format.extent290983 bytes-
dc.subjecton-line deterministic algorithmen
dc.subjectweighted bipartite matching problemen
dc.subjectcompetitive ratioen
dc.subjectrandomized on-lineen
dc.titleOn-line algorithms for weighted bipartite matching and stable marriagesen
Appears in Collections:Computer Science and Engineering

Files in This Item:

File Description SizeFormat
khullerlin94.pdf284.16 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback