On Random Betweenness Constraints

DOI10.1007/978-3-642-03409-1_15zbMath1252.68152OpenAlexW1591028900MaRDI QIDQ3183605

Andreas Goerdt

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

zbMATH Keywords

algorithmsprobabilistic analysisrandom structures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

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

This page was built for publication: On Random Betweenness Constraints