LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs

DOI10.1137/1.9781611974782.128zbMath1417.90142arXiv1606.05198OpenAlexW2949245734MaRDI QIDQ4575875

Nikhil Bansal, Seeun William Umboh, Daniel Reichman

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation algorithms (68W25)

Related Items (3)

Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs