On Random Betweenness Constraints
From MaRDI portal
Publication:3183605
DOI10.1007/978-3-642-03409-1_15zbMath1252.68152MaRDI QIDQ3183605
Publication date: 20 October 2009
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03409-1_15
68Q25: Analysis of algorithms and problem complexity
Related Items
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables, A mixed integer linear programming formulation of the maximum betweenness problem