Tractable cases of the extended global cardinality constraint

We study the consistency and domain consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain for each variable x , and a “cardinality set” K ( d ) of non-negative integers for each value d . The probl...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Constraints : an international journal Ročník 16; číslo 1; s. 1 - 24
Hlavní autori:	Samer, Marko, Szeider, Stefan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.01.2011 Springer
Predmet:	Applied sciences Artificial Intelligence Computer Science Computer science; control theory; systems Exact sciences and technology Flows in networks. Combinatorial problems Information retrieval. Graph Operational research and scientific management Operational research. Management science Operations Research/Decision Theory Optimization Theoretical computing Domain consistency Bounded treewidth Global constraints General factor problem Parameterized complexity Constraint satisfaction Linear time Treewidth Constrained optimization Polynomial time Multiplicity NP complete problem Bipartite graph Graph matching
ISSN:	1383-7133, 1572-9354
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!