Abstract
Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear ordering of the variables in question. A clause becomes true given a linear ordering iff the relative ordering of its variables obeys the constraint. The naturally arising satisfiability problems are NP-complete for many types of constraints.
The present paper seems to be one of the first looking at random ordering constraints. Experimental evidence suggests threshold phenomena as in the case of random k-SAT instances. We prove first that random instances of the cyclic ordering and betweenness constraint have a sharp threshold for unsatisfiability. Second, random instances of the cyclic ordering constraint are satisfiable with high probability if the number of clauses is \(\le 1 \times\,\, \sharp\)variables.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ailon, N., Alon, N.: Hardness of fully dense problems. Information and Computation 205(8), 1117–1129 (2007)
Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley-Interscience Publications, Hoboken (1992)
Beame, P., Karp, R., Pitassi, T., Saks, M.: The efficiency of resolution and Davis-Putnam procedures. SIAM Journal on Computing 31(4), 1048–1075 (2002)
Bodirsky, M., Kára, J.: The complexity of temporal constraint satisfaction problems. In: Proceedings of SToC 2008, pp. 29–38. ACM, New York (2008)
Bollobas, B.: Random Graphs. Academic Press, London (1985)
Christof, T., Jünger, M., Kececioglu, J., Mutzel, P., Reinelt, G.: A branch-and-cut approach to physical mapping with end-probes
Chor, B., Sudan, M.: A geometric approach to betweenness. SIAM Journal on Disctete Mathematics 11(4), 511–523 (1998)
Dubois, O., Boufkhad, Y., Mandler, J.: Typical random 3-SAT formulae and the satisfiability threshold. In: Proceedings 11th SODA, pp. 126–127 (2000)
Erdös, P., Renyi, A.: On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Science 5, 17–61 (1960)
Friedgut, E.: Necessary and sufficient conditions for sharp thresholds of graph properties and the k-SAT problem. Journal of the American Mathematical Society 12, 1017–1054 (1999)
Friedgut, E.: Hunting for sharp thresholds. Random Structures and Algorithms 26(1-2), 37–51 (2005)
Friedgut, E., Krivelevich, M.: Sharp Thresholds for Ramsey Properties of Random Graphs. Random Structures and Algorithms 17(1), 1–19 (2000)
Galil, Z., Meggido, N.: Cyclic ordering is NP-complete. Theoretical Computer Science 5(2), 179–182 (1977)
Guttmann, W., Maucher, M.: Variations on an ordering theme with constraints. In: Proceedings Fourth IFIP International Conference on Theoretical Computer Science, TCS 2006. IFIP, vol. 209, pp. 77–90. Springer, Heidelberg (2006)
Isli, A., Cohen, A.G.: An Algebra for cyclic ordering of 2D orientation. In: Proceedings of the 15th American Conference on Artificial Intelligence (AAAI), pp. 643–649. MIT Press, Cambridge (1998)
Hatami, H., Molloy, M.: Sharp Thresholds for Constraint Satisfaction Problems and Homomorphisms. Random Structures and Algorithms 33(3), 310–332 (2008)
Karp, R.M.: The transitive closure of a random digraph. Random Structures and Algorithms 1(1), 73–93
Molloy, M.: Models and thresholds for random constraint satisfaction problems. In: Proceedings SToC 2002, pp. 209–217. ACM, New York (2002)
Molloy, M.: When does the giant component bring unsatisfiability? Combinatorica 28, 693–735 (2008)
Molloy, M.: The pure literal rule threshold and cores in random hypergraphs. In: Proceedings SoDA 2004, pp. 665–674 (2004)
Opatrny, J.: Total ordering problem. SIAM Journal on Computing 8(1), 111–114 (1979)
Palasti, I.: On the threshold distribution function of cycles in a directed random graph. Studia Scientiarum Mathematicarum Hungarica 6, 67–73 (1971)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goerdt, A. (2009). On Random Ordering Constraints. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds) Computer Science - Theory and Applications. CSR 2009. Lecture Notes in Computer Science, vol 5675. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03351-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-03351-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03350-6
Online ISBN: 978-3-642-03351-3
eBook Packages: Computer ScienceComputer Science (R0)