6,485 research outputs found

    Bounded Max-Colorings of Graphs

    Full text link
    In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at most bb and of weight equal to the weight of the heaviest vertex/edge in this class. The bounded max-vertex/edge-coloring problems ask for such a coloring minimizing the sum of all color classes' weights. In this paper we present complexity results and approximation algorithms for those problems on general graphs, bipartite graphs and trees. We first show that both problems are polynomial for trees, when the number of colors is fixed, and HbH_b approximable for general graphs, when the bound bb is fixed. For the bounded max-vertex-coloring problem, we show a 17/11-approximation algorithm for bipartite graphs, a PTAS for trees as well as for bipartite graphs when bb is fixed. For unit weights, we show that the known 4/3 lower bound for bipartite graphs is tight by providing a simple 4/3 approximation algorithm. For the bounded max-edge-coloring problem, we prove approximation factors of 32/2b3-2/\sqrt{2b}, for general graphs, min{e,32/b}\min\{e, 3-2/\sqrt{b}\}, for bipartite graphs, and 2, for trees. Furthermore, we show that this problem is NP-complete even for trees. This is the first complexity result for max-coloring problems on trees.Comment: 13 pages, 5 figure

    A Time Hierarchy Theorem for the LOCAL Model

    Full text link
    The celebrated Time Hierarchy Theorem for Turing machines states, informally, that more problems can be solved given more time. The extent to which a time hierarchy-type theorem holds in the distributed LOCAL model has been open for many years. It is consistent with previous results that all natural problems in the LOCAL model can be classified according to a small constant number of complexities, such as O(1),O(logn),O(logn),2O(logn)O(1),O(\log^* n), O(\log n), 2^{O(\sqrt{\log n})}, etc. In this paper we establish the first time hierarchy theorem for the LOCAL model and prove that several gaps exist in the LOCAL time hierarchy. 1. We define an infinite set of simple coloring problems called Hierarchical 2122\frac{1}{2}-Coloring}. A correctly colored graph can be confirmed by simply checking the neighborhood of each vertex, so this problem fits into the class of locally checkable labeling (LCL) problems. However, the complexity of the kk-level Hierarchical 2122\frac{1}{2}-Coloring problem is Θ(n1/k)\Theta(n^{1/k}), for kZ+k\in\mathbb{Z}^+. The upper and lower bounds hold for both general graphs and trees, and for both randomized and deterministic algorithms. 2. Consider any LCL problem on bounded degree trees. We prove an automatic-speedup theorem that states that any randomized no(1)n^{o(1)}-time algorithm solving the LCL can be transformed into a deterministic O(logn)O(\log n)-time algorithm. Together with a previous result, this establishes that on trees, there are no natural deterministic complexities in the ranges ω(logn)\omega(\log^* n)---o(logn)o(\log n) or ω(logn)\omega(\log n)---no(1)n^{o(1)}. 3. We expose a gap in the randomized time hierarchy on general graphs. Any randomized algorithm that solves an LCL problem in sublogarithmic time can be sped up to run in O(TLLL)O(T_{LLL}) time, which is the complexity of the distributed Lovasz local lemma problem, currently known to be Ω(loglogn)\Omega(\log\log n) and O(logn)O(\log n)
    corecore