Back to Results
First PageMeta Content
Theoretical computer science / Local consistency / Constraint satisfaction / Interval graph / Intersection graph / Linear programming / Decomposition method / Constraint programming / Graph theory / Software engineering


Filtering Algorithms for the NValue Constraint Christian Bessiere1 , Emmanuel Hebrard2 , Brahim Hnich3 , Zeynep Kiziltan4 , and Toby Walsh2 1 LIRMM, CNRS/University of Montpellier, France
Add to Reading List

Document Date: 2010-11-22 06:22:31


Open Document

File Size: 186,34 KB

Share Result on Facebook

City

Cork / Sydney / /

Company

Ci / 3SAT / LP MD LP / X5 / Cj / /

Country

France / Italy / Australia / Ireland / /

/

Facility

University of Montpellier / University of Bologna / /

IndustryTerm

polynomial algorithm / heuristic algorithm / maximum matching algorithm / even computing / greedy algorithm / natural greedy algorithm / approximation algorithms / propagation algorithm / /

Organization

University of Montpellier / University of Bologna / /

ProvinceOrState

Maryland / British Columbia / /

Technology

maximum matching algorithm / filtering algorithm / propagation algorithm / natural greedy algorithm / interval-based algorithm / greedy algorithm / 4 Existing algorithm / approximation algorithms / worst case time complexity Algorithm / present two algorithms / same algorithm / following algorithms / polynomial algorithm / /

SocialTag