378 research outputs found
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms
A k-uniform hypergraph is said to be r-rainbow colorable if there is an r-coloring of its vertices such that every hyperedge intersects all r color classes. Given as input such a hypergraph, finding a r-rainbow coloring of it is NP-hard for all k >= 3 and r >= 2. Therefore, one settles for finding a rainbow coloring with fewer colors (which is an easier task). When r=k (the maximum possible value), i.e., the hypergraph is k-partite, one can efficiently 2-rainbow color the hypergraph, i.e., 2-color its vertices so that there are no monochromatic edges. In this work we consider the next smaller value of r=k-1, and prove that in this case it is NP-hard to rainbow color the hypergraph with q := ceil[(k-2)/2] colors. In particular, for k <=6, it is NP-hard to 2-color (k-1)-rainbow colorable k-uniform hypergraphs.
Our proof follows the algebraic approach to promise constraint satisfaction problems. It proceeds by characterizing the polymorphisms associated with the approximate rainbow coloring problem, which are rainbow colorings of some product hypergraphs on vertex set [r]^n. We prove that any such polymorphism f: [r]^n -> [q] must be C-fixing, i.e., there is a small subset S of C coordinates and a setting a in [q]^S such that fixing x_{|S} = a determines the value of f(x). The key step in our proof is bounding the sensitivity of certain rainbow colorings, thereby arguing that they must be juntas. Armed with the C-fixing characterization, our NP-hardness is obtained via a reduction from smooth Label Cover
Randomisierte Approximation für das Matching- und Knotenüberdeckung Problem in Hypergraphen: Komplexität und Algorithmen
This thesis studies the design and mathematical analysis of randomized approximation algorithms for the hitting set and b-matching problems in hypergraphs.
We present a randomized algorithm for the hitting set problem based on linear programming. The analysis of the randomized algorithm rests upon the probabilistic method, more precisely on some concentration inequalities for the sum of independent random variables plus some martingale based inequalities, as the bounded difference inequality, which is a derived from Azuma inequality.
In combination with combinatorial arguments we achieve some new results for different instance classes that improve upon the known approximation results for the problem (Krevilevich (1997), Halperin (2001)).
We analyze the complexity of the b-matching problem in hypergraphs and obtain two new results.
We give a polynomial time reduction from an instance of a suitable problem to an instance of the b-matching problem and prove a non-approximability ratio for the problem in l-uniform hypergraphs. This generalizes the result of Safra et al. (2006) from b=1 to b in O(l/log(l)). Safra et al. showed that the 1-matching problem in l-uniform hypergraphs can not be approximated in polynomial time within a ratio O(l/log(l)), unless P = NP.
Moreover, we show that the b-matching problem on l-uniform
hypergraphs with bounded vertex degree has no polynomial time
approximation scheme PTAS, unless P=NP.Diese Arbeit befasst sich mit dem Entwurf und der mathematischen
Analyse von randomisierten Approximationsalgorithmen für das Hitting
Set Problem und das b-Matching Problem in Hypergraphen.
Zuerst präsentieren wir einen randomisierten Algorithmus für das
Hitting Set Problem, der auf linearer Programmierung basiert. Mit
diesem Verfahren und einer Analyse, die auf der probabilistischen
Methode fußt, erreichen wir für verschiedene Klassen von Instanzen
drei neue Approximationsgüten, die die bisher bekannten Ergebnisse
(Krevilevich [1997], Halperin [2001]) für das Problem verbessern. Die Analysen beruhen auf Konzentrationsungleichungen für Summen von
unabhängigen Zufallsvariablen aber auch Martingal-basierten Ungleichungen, wie die aus der Azuma-Ungleichung abgeleitete Bounded
Difference-Inequality, in Kombination mit kombinatorischen Argumenten.
Für das b-Matching Problem in Hypergraphen analysieren wir zunächst
seine Komplexität und erhalten zwei neue Ergebnisse.
Wir geben eine polynomielle Reduktion von einer Instanz eines geeigneten Problems zu einer Instanz des b-Matching-Problems an und
zeigen ein Nicht-Approximierbarkeitsresultat für das Problem in uniformen Hypergraphen. Dieses Resultat verallgemeinert das Ergebnis
von Safra et al. (2006) von b = 1 auf b in O(l/log(l))).
Safra et al. zeigten, dass es für das 1-Matching Problem in uniformen Hypergraphen unter der Annahme P != NP keinen polynomiellen Approximationsalgorithmus mit einer Ratio O(l/log(l)) gibt.
Weiterhin beweisen wir, dass es in uniformen Hypergraphen mit beschränktem Knoten-Grad kein PTAS für das Problem gibt, es sei denn
P = NP
Recommended from our members
Combinatorics
Combinatorics is a fundamental mathematical discipline that focuses on the study of discrete objects and their properties. The present workshop featured research in such diverse areas as Extremal, Probabilistic and Algebraic Combinatorics, Graph Theory, Discrete Geometry, Combinatorial Optimization, Theory of Computation and Statistical Mechanics. It provided current accounts of exciting developments and challenges in these fields and a stimulating venue for a variety of fruitful interactions. This is a report on the meeting, containing abstracts of the presentations and a summary of the problem session
Recommended from our members
Algorithmic Graph Theory
The main focus of this workshop was on mathematical techniques needed for the development of efficient solutions and algorithms for computationally difficult graph problems. The techniques studied at the workshhop included: the probabilistic method and randomized algorithms, approximation and optimization, structured families of graphs and approximation algorithms for large problems. The workshop Algorithmic Graph Theory was attended by 46 participants, many of them being young researchers. In 15 survey talks an overview of recent developments in Algorithmic Graph Theory was given. These talks were supplemented by 10 shorter talks and by two special sessions
LIPIcs, Volume 244, ESA 2022, Complete Volume
LIPIcs, Volume 244, ESA 2022, Complete Volum
- …