27,797 research outputs found

    Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs

    Full text link
    Let GG be a graph where each vertex is associated with a label. A Vertex-Labeled Approximate Distance Oracle is a data structure that, given a vertex vv and a label λ\lambda, returns a (1+ε)(1+\varepsilon)-approximation of the distance from vv to the closest vertex with label λ\lambda in GG. Such an oracle is dynamic if it also supports label changes. In this paper we present three different dynamic approximate vertex-labeled distance oracles for planar graphs, all with polylogarithmic query and update times, and nearly linear space requirements

    Covering Paths and Trees for Planar Grids

    Get PDF
    Given a set of points in the plane, a covering path is a polygonal path that visits all the points. In this paper we consider covering paths of the vertices of an n x m grid. We show that the minimal number of segments of such a path is 2min(n,m)12\min(n,m)-1 except when we allow crossings and n=m3n=m\ge 3, in which case the minimal number of segments of such a path is 2min(n,m)22\min(n,m)-2, i.e., in this case we can save one segment. In fact we show that these are true even if we consider covering trees instead of paths. These results extend previous works on axis-aligned covering paths of n x m grids and complement the recent study of covering paths for points in general position, in which case the problem becomes significantly harder and is still open

    Non-Uniform Robust Network Design in Planar Graphs

    Get PDF
    Robust optimization is concerned with constructing solutions that remain feasible also when a limited number of resources is removed from the solution. Most studies of robust combinatorial optimization to date made the assumption that every resource is equally vulnerable, and that the set of scenarios is implicitly given by a single budget constraint. This paper studies a robustness model of a different kind. We focus on \textbf{bulk-robustness}, a model recently introduced~\cite{bulk} for addressing the need to model non-uniform failure patterns in systems. We significantly extend the techniques used in~\cite{bulk} to design approximation algorithm for bulk-robust network design problems in planar graphs. Our techniques use an augmentation framework, combined with linear programming (LP) rounding that depends on a planar embedding of the input graph. A connection to cut covering problems and the dominating set problem in circle graphs is established. Our methods use few of the specifics of bulk-robust optimization, hence it is conceivable that they can be adapted to solve other robust network design problems.Comment: 17 pages, 2 figure

    On the tractability of some natural packing, covering and partitioning problems

    Get PDF
    In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuits, forests, spanning trees, (not necessarily spanning) trees and cuts. Given an undirected graph G=(V,E)G=(V,E) and two "object types" A\mathrm{A} and B\mathrm{B} chosen from the alternatives above, we consider the following questions. \textbf{Packing problem:} can we find an object of type A\mathrm{A} and one of type B\mathrm{B} in the edge set EE of GG, so that they are edge-disjoint? \textbf{Partitioning problem:} can we partition EE into an object of type A\mathrm{A} and one of type B\mathrm{B}? \textbf{Covering problem:} can we cover EE with an object of type A\mathrm{A}, and an object of type B\mathrm{B}? This framework includes 44 natural graph theoretic questions. Some of these problems were well-known before, for example covering the edge-set of a graph with two spanning trees, or finding an ss-tt path PP and an ss'-tt' path PP' that are edge-disjoint. However, many others were not, for example can we find an ss-tt path PEP\subseteq E and a spanning tree TET\subseteq E that are edge-disjoint? Most of these previously unknown problems turned out to be NP-complete, many of them even in planar graphs. This paper determines the status of these 44 problems. For the NP-complete problems we also investigate the planar version, for the polynomial problems we consider the matroidal generalization (wherever this makes sense)

    Small Superpatterns for Dominance Drawing

    Full text link
    We exploit the connection between dominance drawings of directed acyclic graphs and permutations, in both directions, to provide improved bounds on the size of universal point sets for certain types of dominance drawing and on superpatterns for certain natural classes of permutations. In particular we show that there exist universal point sets for dominance drawings of the Hasse diagrams of width-two partial orders of size O(n^{3/2}), universal point sets for dominance drawings of st-outerplanar graphs of size O(n\log n), and universal point sets for dominance drawings of directed trees of size O(n^2). We show that 321-avoiding permutations have superpatterns of size O(n^{3/2}), riffle permutations (321-, 2143-, and 2413-avoiding permutations) have superpatterns of size O(n), and the concatenations of sequences of riffles and their inverses have superpatterns of size O(n\log n). Our analysis includes a calculation of the leading constants in these bounds.Comment: ANALCO 2014, This version fixes an error in the leading constant of the 321-superpattern siz

    Which point sets admit a k-angulation?

    Get PDF
    For k >= 3, a k-angulation is a 2-connected plane graph in which every internal face is a k-gon. We say that a point set P admits a plane graph G if there is a straight-line drawing of G that maps V(G) onto P and has the same facial cycles and outer face as G. We investigate the conditions under which a point set P admits a k-angulation and find that, for sets containing at least 2k^2 points, the only obstructions are those that follow from Euler's formula.Comment: 13 pages, 7 figure

    Pfaffian Correlation Functions of Planar Dimer Covers

    Full text link
    The Pfaffian structure of the boundary monomer correlation functions in the dimer-covering planar graph models is rederived through a combinatorial / topological argument. These functions are then extended into a larger family of order-disorder correlation functions which are shown to exhibit Pfaffian structure throughout the bulk. Key tools involve combinatorial switching symmetries which are identified through the loop-gas representation of the double dimer model, and topological implications of planarity.Comment: Revised figures; corrected misprint
    corecore