The densest κ-subhypergraph problem

Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca

פרסום מחקרי: פרק בספר / בדוח / בכנספרסום בספר כנסביקורת עמיתים

תקציר

The Densest κ-Subgraph (DκS) problem, and its corresponding minimization problem Smallest p-Edge Subgraph (SpES), have come to play a central role in approximation algorithms. This is due both to their practical importance, and their usefulness as a tool for solving and establishing approximation bounds for other problems. These two problems are not well understood, and it is widely believed that they do not an admit a subpolynomial approximation ratio (although the best known hardness results do not rule this out). In this paper we generalize both DkS and SpES from graphs to hypergraphs. We consider the Densest k-Subhypergraph problem (given a hypergraph (V,E), find a subset W C V of k vertices so as to maximize the number of hyperedges contained in W) and define the Minimum p-Union problem (given a hypergraph, choose p of the hyperedges so as to minimize the number of vertices in their union). We focus in particular on the case where all hyperedges have size 3, as this is the simplest non-graph setting. For this case we provide an O(n4 (4-√3)/13+ϵ) ≤ O(n0.697831+ϵ)-approximation (for arbitrary constant ϵ > 0) for Densest κ-Subhypergraph and an O(√m)-approximation for Minimum p-Union. We also give an O(p m)-Approximation for Minimum p-Union in general hypergraphs. Finally, we examine the interesting special case of interval hypergraphs (instances where the vertices are a subset of the natural numbers and the hyperedges are intervals of the line) and prove that both problems admit an exact polynomial time solution on these instances.

שפה מקוריתאנגלית
כותר פרסום המארחApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 19th International Workshop, APPROX 2016 and 20th International Workshop, RANDOM 2016
עורכיםKlaus Jansen, Claire Mathieu, Jose D. P. Rolim, Chris Umans
מוציא לאורSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
מסת"ב (אלקטרוני)9783959770187
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 1 ספט׳ 2016
פורסם באופן חיצוניכן
אירוע19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016 - Paris, צרפת
משך הזמן: 7 ספט׳ 20169 ספט׳ 2016

סדרות פרסומים

שםLeibniz International Proceedings in Informatics, LIPIcs
כרך60
ISSN (מודפס)1868-8969

כנס

כנס19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016
מדינה/אזורצרפת
עירParis
תקופה7/09/169/09/16

הערה ביבליוגרפית

Funding Information:
Partially supported by NSF grants 1464239 and 1535887.

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'The densest κ-subhypergraph problem'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי