LP-branching algorithms based on biased graphs

DOI10.1137/1.9781611974782.102zbMath1422.90065arXiv1610.06060OpenAlexW2951611859MaRDI QIDQ4575845

Magnus Wahlström

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/1610.06060

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

An Updated Experimental Evaluation of Graph Bipartization Methods ⋮ Unnamed Item

This page was built for publication: LP-branching algorithms based on biased graphs