187,991 research outputs found

    The Online Disjoint Set Cover Problem and its Applications

    Full text link
    Given a universe UU of nn elements and a collection of subsets S\mathcal{S} of UU, the maximum disjoint set cover problem (DSCP) is to partition S\mathcal{S} into as many set covers as possible, where a set cover is defined as a collection of subsets whose union is UU. We consider the online DSCP, in which the subsets arrive one by one (possibly in an order chosen by an adversary), and must be irrevocably assigned to some partition on arrival with the objective of minimizing the competitive ratio. The competitive ratio of an online DSCP algorithm AA is defined as the maximum ratio of the number of disjoint set covers obtained by the optimal offline algorithm to the number of disjoint set covers obtained by AA across all inputs. We propose an online algorithm for solving the DSCP with competitive ratio lnn\ln n. We then show a lower bound of Ω(lnn)\Omega(\sqrt{\ln n}) on the competitive ratio for any online DSCP algorithm. The online disjoint set cover problem has wide ranging applications in practice, including the online crowd-sourcing problem, the online coverage lifetime maximization problem in wireless sensor networks, and in online resource allocation problems.Comment: To appear in IEEE INFOCOM 201

    Revisiting path-type covering and partitioning problems

    Get PDF
    This is a survey article which is at the initial stage. The author will appreciate to receive your comments and contributions to improve the quality of the article. The author's contact address is [email protected] problems belong to the foundation of graph theory. There are several types of covering problems in graph theory such as covering the vertex set by stars (domination problem), covering the vertex set by cliques (clique covering problem), covering the vertex set by independent sets (coloring problem), and covering the vertex set by paths or cycles. A similar concept which is partitioning problem is also equally important. Lately research in graph theory has produced unprecedented growth because of its various application in engineering and science. The covering and partitioning problem by paths itself have produced a sizable volume of literatures. The research on these problems is expanding in multiple directions and the volume of research papers is exploding. It is the time to simplify and unify the literature on different types of the covering and partitioning problems. The problems considered in this article are path cover problem, induced path cover problem, isometric path cover problem, path partition problem, induced path partition problem and isometric path partition problem. The objective of this article is to summarize the recent developments on these problems, classify their literatures and correlate the inter-relationship among the related concepts

    Optimal Vertex Cover for the Small-World Hanoi Networks

    Full text link
    The vertex-cover problem on the Hanoi networks HN3 and HN5 is analyzed with an exact renormalization group and parallel-tempering Monte Carlo simulations. The grand canonical partition function of the equivalent hard-core repulsive lattice-gas problem is recast first as an Ising-like canonical partition function, which allows for a closed set of renormalization group equations. The flow of these equations is analyzed for the limit of infinite chemical potential, at which the vertex-cover problem is attained. The relevant fixed point and its neighborhood are analyzed, and non-trivial results are obtained both, for the coverage as well as for the ground state entropy density, which indicates the complex structure of the solution space. Using special hierarchy-dependent operators in the renormalization group and Monte-Carlo simulations, structural details of optimal configurations are revealed. These studies indicate that the optimal coverages (or packings) are not related by a simple symmetry. Using a clustering analysis of the solutions obtained in the Monte Carlo simulations, a complex solution space structure is revealed for each system size. Nevertheless, in the thermodynamic limit, the solution landscape is dominated by one huge set of very similar solutions.Comment: RevTex, 24 pages; many corrections in text and figures; final version; for related information, see http://www.physics.emory.edu/faculty/boettcher

    Generalization of edge general position problem

    Full text link
    The edge geodesic cover problem of a graph GG is to find a smallest number of geodesics that cover the edge set of GG. The edge kk-general position problem is introduced as the problem to find a largest set SS of edges of GG such that no k1k-1 edges of SS lie on a common geodesic. We study this dual min-max problems and connect them to an edge geodesic partition problem. Using these connections, exact values of the edge kk-general position number is determined for different values of kk and for different networks including torus networks, hypercubes, and Benes networks.Comment: This research is supported by Kuwait University, Kuwai

    Reinforcement learning based local search for grouping problems: A case study on graph coloring

    Get PDF
    Grouping problems aim to partition a set of items into multiple mutually disjoint subsets according to some specific criterion and constraints. Grouping problems cover a large class of important combinatorial optimization problems that are generally computationally difficult. In this paper, we propose a general solution approach for grouping problems, i.e., reinforcement learning based local search (RLS), which combines reinforcement learning techniques with descent-based local search. The viability of the proposed approach is verified on a well-known representative grouping problem (graph coloring) where a very simple descent-based coloring algorithm is applied. Experimental studies on popular DIMACS and COLOR02 benchmark graphs indicate that RLS achieves competitive performances compared to a number of well-known coloring algorithms
    corecore