A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection

DOI10.1145/2746539.2746564zbMath1321.68501arXiv1504.08008OpenAlexW2018419361WikidataQ60143012 ScholiaQ60143012MaRDI QIDQ2941581

Shay Mozes, Kyle Fox, Philip N. Klein

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.08008

zbMATH Keywords

planar graphsbipartitionspannerbisectioncyclic double coverbicriteria approximation schemePC-clustering

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Signed and weighted graphs (05C22)

Related Items (1)

A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

This page was built for publication: A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection