@InProceedings{beideman_et_al:LIPIcs.APPROX/RANDOM.2020.17,
author = {Beideman, Calvin and Chandrasekaran, Karthekeyan and Xu, Chao},
title = {{Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {17:1--17:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.17},
URN = {urn:nbn:de:0030-drops-126203},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.17},
annote = {Keywords: Multiobjective Optimization, Hypergraph min-cut, Hypergraph-k-cut}
}