On Random Betweenness Constraints

DOI10.1007/978-3-642-03409-1_15zbMATH Open1252.68152OpenAlexW1591028900MaRDI QIDQ3183605FDOQ3183605

Authors: 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

Recommendations

• On random betweenness constraints
• On Random Ordering Constraints
• A Geometric Approach to Betweenness
• Threshold properties of random Boolean constraint satisfaction problems
• A geometric approach to betweenness

zbMATH Keywords

algorithmsprobabilistic analysisrandom structures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (6)

• Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
• A geometric approach to betweenness
• A mixed integer linear programming formulation of the maximum betweenness problem
• Violations of betweenness or random errors?
• On random betweenness constraints
• On Random Ordering Constraints

This page was built for publication: On Random Betweenness Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183605)