English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Quasi-popular Matchings, Optimality, and Extended Formulations

MPS-Authors
/persons/resource/persons198693

Kavitha,  Telikepalli
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Faenza, Y., & Kavitha, T. (2020). Quasi-popular Matchings, Optimality, and Extended Formulations. In S. Chawla (Ed.), Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms (pp. 325-344). Philadelphia, PA: SIAM. doi:10.5555/3381089.3381109.


Cite as: http://hdl.handle.net/21.11116/0000-0006-F26C-0
Abstract
There is no abstract available