Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class

We develop a framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world networks) while still guaranteeing approximation ratios. The idea is to edit a given graph via vertex- or edge-deletions to put the graph into an algorithmically tractable class, apply known approximation algorithms for that class, and then lift the solution to apply to the original graph. We give a general characterization of when an optimization problem is amenable to this approach, and show that it includes many well-studied graph problems, such as Independent Set, Vertex Cover, Feedback Vertex Set, Minimum Maximal Matching, Chromatic Number, (l-)Dominating Set, Edge (l-)Dominating Set, and Connected Dominating Set. To enable this framework, we develop new editing algorithms that find the approximately-fewest edits required to bring a given graph into one of a few important graph classes (in some cases these are bicriteria algorithms which simultaneously approximate both the number of editing operations and the target parameter of the family). For bounded degeneracy, we obtain an O(r log{n})-approximation and a bicriteria (4,4)-approximation which also extends to a smoother bicriteria trade-off. For bounded treewidth, we obtain a bicriteria (O(log^{1.5} n), O(sqrt{log w}))-approximation, and for bounded pathwidth, we obtain a bicriteria (O(log^{1.5} n), O(sqrt{log w} * log n))-approximation. For treedepth 2 (related to bounded expansion), we obtain a 4-approximation. We also prove complementary hardness-of-approximation results assuming P != NP: in particular, these problems are all log-factor inapproximable, except the last which is not approximable below some constant factor 2 (assuming UGC)

Distributed Dominating Set Approximations beyond Planar Graphs

The Minimum Dominating Set (MDS) problem is one of the most fundamental and challenging problems in distributed computing. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last years, there has been much progress on computing local approximations on sparse graphs, and in particular planar graphs. In this paper we study distributed and deterministic MDS approximation algorithms for graph classes beyond planar graphs. In particular, we show that existing approximation bounds for planar graphs can be lifted to bounded genus graphs, and present (1) a local constant-time, constant-factor MDS approximation algorithm and (2) a local $\mathcal{O}(\log^*{n})$-time approximation scheme. Our main technical contribution is a new analysis of a slightly modified variant of an existing algorithm by Lenzen et al. Interestingly, unlike existing proofs for planar graphs, our analysis does not rely on direct topological arguments.Comment: arXiv admin note: substantial text overlap with arXiv:1602.0299

Testing bounded arboricity

In this paper we consider the problem of testing whether a graph has bounded arboricity. The family of graphs with bounded arboricity includes, among others, bounded-degree graphs, all minor-closed graph classes (e.g. planar graphs, graphs with bounded treewidth) and randomly generated preferential attachment graphs. Graphs with bounded arboricity have been studied extensively in the past, in particular since for many problems they allow for much more efficient algorithms and/or better approximation ratios. We present a tolerant tester in the sparse-graphs model. The sparse-graphs model allows access to degree queries and neighbor queries, and the distance is defined with respect to the actual number of edges. More specifically, our algorithm distinguishes between graphs that are $\epsilon$-close to having arboricity $\alpha$ and graphs that $c \cdot \epsilon$-far from having arboricity $3\alpha$, where $c$ is an absolute small constant. The query complexity and running time of the algorithm are $\tilde{O}\left(\frac{n}{\sqrt{m}}\cdot \frac{\log(1/\epsilon)}{\epsilon} + \frac{n\cdot \alpha}{m} \cdot \left(\frac{1}{\epsilon}\right)^{O(\log(1/\epsilon))}\right)$ where $n$ denotes the number of vertices and $m$ denotes the number of edges. In terms of the dependence on $n$ and $m$ this bound is optimal up to poly-logarithmic factors since $\Omega(n/\sqrt{m})$ queries are necessary (and $\alpha = O(\sqrt{m}))$. We leave it as an open question whether the dependence on $1/\epsilon$ can be improved from quasi-polynomial to polynomial. Our techniques include an efficient local simulation for approximating the outcome of a global (almost) forest-decomposition algorithm as well as a tailored procedure of edge sampling

Tight-binding g-Factor Calculations of CdSe Nanostructures

The Lande g-factors for CdSe quantum dots and rods are investigated within the framework of the semiempirical tight-binding method. We describe methods for treating both the n-doped and neutral nanostructures, and then apply these to a selection of nanocrystals of variable size and shape, focusing on approximately spherical dots and rods of differing aspect ratio. For the negatively charged n-doped systems, we observe that the g-factors for near-spherical CdSe dots are approximately independent of size, but show strong shape dependence as one axis of the quantum dot is extended to form rod-like structures. In particular, there is a discontinuity in the magnitude of g-factor and a transition from anisotropic to isotropic g-factor tensor at aspect ratio ~1.3. For the neutral systems, we analyze the electron g-factor of both the conduction and valence band electrons. We find that the behavior of the electron g-factor in the neutral nanocrystals is generally similar to that in the n-doped case, showing the same strong shape dependence and discontinuity in magnitude and anisotropy. In smaller systems the g-factor value is dependent on the details of the surface model. Comparison with recent measurements of g-factors for CdSe nanocrystals suggests that the shape dependent transition may be responsible for the observations of anomalous numbers of g-factors at certain nanocrystal sizes.Comment: 15 pages, 6 figures. Fixed typos to match published versio

Playing relativistic billiards beyond graphene

The possibility of using hexagonal structures in general and graphene in particular to emulate the Dirac equation is the basis of our considerations. We show that Dirac oscillators with or without restmass can be emulated by distorting a tight binding model on a hexagonal structure. In a quest to make a toy model for such relativistic equations we first show that a hexagonal lattice of attractive potential wells would be a good candidate. First we consider the corresponding one-dimensional model giving rise to a one-dimensional Dirac oscillator, and then construct explicitly the deformations needed in the two-dimensional case. Finally we discuss, how such a model can be implemented as an electromagnetic billiard using arrays of dielectric resonators between two conducting plates that ensure evanescent modes outside the resonators for transversal electric modes, and describe an appropriate experimental setup.Comment: 23 pages, 8 figures. Submitted to NJ