A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond
From MaRDI portal
Publication:5236278
DOI10.1137/1.9781611975482.94zbMath1431.68176OpenAlexW4239790894MaRDI QIDQ5236278
Publication date: 15 October 2019
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611975482.94
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (1)
This page was built for publication: A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond