Universität zu Köln

Bercea, Ioana Oriana, Groß, Martin, Khuller, Samir, Kumar, Aounon, Rösner, Clemens, Schmidt, Daniel R. ORCID: 0000-0001-7381-912X and Schmidt, Melanie ORCID: 0000-0003-4856-3905 (2019). On the Cost of Essentially Fair Clusterings. In: Approximation, randomization, and combinatorial optimization: algorithms and techniques : APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, 18:1-18:22. Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. ISBN 9783959771252

Full text not available from this repository.

Item Type:	Book Section, Proceedings Item or annotation in a legal commentary
Creators:	Creators Email ORCID ORCID Put Code Bercea, Ioana Oriana UNSPECIFIED UNSPECIFIED UNSPECIFIED Groß, Martin UNSPECIFIED UNSPECIFIED UNSPECIFIED Khuller, Samir UNSPECIFIED UNSPECIFIED UNSPECIFIED Kumar, Aounon UNSPECIFIED UNSPECIFIED UNSPECIFIED Rösner, Clemens UNSPECIFIED UNSPECIFIED UNSPECIFIED Schmidt, Daniel R. UNSPECIFIED orcid.org/0000-0001-7381-912X UNSPECIFIED Schmidt, Melanie UNSPECIFIED orcid.org/0000-0003-4856-3905 UNSPECIFIED
URN:	urn:nbn:de:hbz:38-117183
DOI:	10.4230/LIPIcs.APPROX-RANDOM.2019.18
Title of Book:	Approximation, randomization, and combinatorial optimization: algorithms and techniques : APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA
Series Name:	LIPIcs
Volume:	145
Page Range:	18:1-18:22
Date:	2019
Publisher:	Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Place of Publication:	Wadern
ISSN:	1868-8969
ISBN:	9783959771252
Language:	English
Faculty:	Faculty of Mathematics and Natural Sciences
Divisions:	Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects:	Data processing Computer science
Refereed:	Yes
URI:	http://kups.ub.uni-koeln.de/id/eprint/11718