eprints
 

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

Please use this identifier to cite or link to this item: http://hdl.handle.net/2074/2347

Full metadata record

DC FieldValueLanguage
contributor.authorKhuller, Samir-
contributor.authorMitchell, Stephen G-
contributor.authorVazirani, Vijay V-
date.accessioned2006-12-06T09:20:10Z-
date.available2006-12-06T09:20:10Z-
date.issued1994-
identifier.citationTheoretical Computer Science, 127(2 ), 255-267p.en
identifier.urihttp://eprint.iitd.ac.in/dspace/handle/2074/2347-
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
format.extent290983 bytes-
format.mimetypeapplication/pdf-
language.isoenen
subjecton-line deterministic algorithmen
subjectweighted bipartite matching problemen
subjectcompetitive ratioen
subjectrandomized on-lineen
titleOn-line algorithms for weighted bipartite matching and stable marriagesen
typeArticleen
Appears in Collections:Computer Science and Engineering

Files in This Item:

File Description SizeFormat
khullerlin94.pdf284KbAdobe PDFView/Open

Show simple item record

All items in DSpace are protected by copyright, with all rights reserved.

 

eprints@IIT Delhi Copyright  © 2004-2005 Powered by DSpace Software  - Feedback