scientific article
From MaRDI portal
Publication:2934724
zbMath1302.05178MaRDI QIDQ2934724
Claire Kenyon-Mathieu, Glencora Borradaile, Philip N. Klein
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (17)
Minimum Cuts in Surface Graphs ⋮ A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ Improved Steiner tree algorithms for bounded treewidth ⋮ Optimal Surface Flattening ⋮ Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible ⋮ Euclidean prize-collecting Steiner forest ⋮ The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs ⋮ A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ Counting and sampling minimum cuts in genus \(g\) graphs ⋮ Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs ⋮ A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs ⋮ A near linear time approximation scheme for Steiner tree among obstacles in the plane ⋮ Travelling on graphs with small highway dimension ⋮ Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication:
