"LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP."

Daniel Prusa, Tomás Werner (2017)

Details and statistics

DOI: 10.1137/1.9781611974782.89

access: open

type: Conference or Workshop Paper

metadata version: 2021-07-25

a service of  Schloss Dagstuhl - Leibniz Center for Informatics