Dynamic programming and lower-bound approaches to the minimum binding problem

DOI10.1080/00207720412331297901zbMath1070.90126OpenAlexW2064795201MaRDI QIDQ4653194

No author found.

Publication date: 7 March 2005

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207720412331297901

zbMATH Keywords

dynamic programming algorithmminimum binding problem

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (1)

Dynamic programming and lower-bound approaches to the minimum binding problem

Cites Work

• Unnamed Item
• Unnamed Item
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Dynamic programming and lower-bound approaches to the minimum binding problem

This page was built for publication: Dynamic programming and lower-bound approaches to the minimum binding problem