Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
From MaRDI portal
Publication:2462149
DOI10.1016/j.ejor.2007.02.014zbMath1138.90345MaRDI QIDQ2462149
Rolf Niedermeier, Jiong Guo, Johannes Uhlmann, Falk Hüffner, Erhan Kenar
Publication date: 23 November 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.02.014
90B10: Deterministic network models in operations research
90C27: Combinatorial optimization
90C39: Dynamic programming