Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints 
Tractable

Fellows, Michael; Friedrich, Tobias; Hermelin, Danny; Nardodytska, Nina; Rosamond, Frances

doi:10.1016/j.tcs.2012.11.038

Local TagsRelease HistoryDetailsSummary

Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable

Fellows, M., Friedrich, T., Hermelin, D., Nardodytska, N., & Rosamond, F. (2013). Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. Theoretical Computer Science, 472, 81-89. doi:10.1016/j.tcs.2012.11.038.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0018-A881-A Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0018-CF44-F

Genre: Journal Article

Latex : Constraint Satisfaction Problems: Convexity Makes {AllDifferent} Constraints Tractable

Files

show Files

Locators

show

Creators

show

hide

Creators:
Fellows, Michael¹, Author
Friedrich, Tobias², Author
Hermelin, Danny², Author
Nardodytska, Nina¹, Author
Rosamond, Frances¹, Author

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2013Date issued: 2013

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.1016/j.tcs.2012.11.038
BibTex Citekey: FriedrichHermelin2013

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Theoretical Computer Science

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : Elsevier

Pages: - Volume / Issue: 472 Sequence Number: - Start / End Page: 81 - 89 Identifier: ISSN: 0304-3975
CoNE: https://pure.mpg.de/cone/journals/resource/954925512450