The Complexity of Constraints on Intervals and Lengths
2002 (English)In: Proc. of the 19th Int'l Symposium on Theoretical Aspects of Computer Science (STACS-2002)', 2002, 443-454 p.Conference paper (Refereed)
We study interval-valued constraint satisfaction problems (CSPs),in which the aim is to find an assignment of intervals to a given set ofvariables subject to constraints on the relative positions of intervals.Many well-known problems such as Interval Graph Recognitionand Interval Satisfiability can be considered as examples of such CSPs.One intersting question concerning such problems is to determine exactlyhow the complexity of an interval-valued CSP depends on the set of constraints allowed in instances. For the framework known as Allen's interval algebra this question was completely answered earlier by the authors by giving a complete description of the tractable cases andshowing that all remaining cases are NP-complete.
Place, publisher, year, edition, pages
2002. 443-454 p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-61728OAI: oai:DiVA.org:liu-61728DiVA: diva2:370706