pdf-format: |
|
@InProceedings{cseh_et_al:LIPIcs:2018:9916, author = {Ágnes Cseh and Telikepalli Kavitha}, title = {{Popular Matchings in Complete Graphs}}, booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)}, pages = {17:1--17:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-093-4}, ISSN = {1868-8969}, year = {2018}, volume = {122}, editor = {Sumit Ganguly and Paritosh Pandya}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9916}, URN = {urn:nbn:de:0030-drops-99164}, doi = {10.4230/LIPIcs.FSTTCS.2018.17}, annote = {Keywords: popular matching, complete graph, complexity, linear programming} }
Keywords: | popular matching, complete graph, complexity, linear programming | |
Seminar: | 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018) | |
Issue date: | 2018 | |
Date of publication: | 05.12.2018 |