Conference paper Open Access

On the Complexity of a Filtering Problem for Constraint Programming: Decomposition by the Structure of Perfect Matchings

Radoslaw Cymer; Miklós Krész

A complexity analysis based on the structure of perfect matchings is given for the most efficient basic filtering algorithms in constraint programming with respect to the role of edges in matchings.

Pages 94-100
Files (1.8 MB)
Name Size
SOR'19 - ON THE COMPLEXITY.pdf
md5:7aa3ebbaf5e8e361d609a6c54c450835 		1.8 MB Download
44
69
views
downloads
All versions This version
Views 4444
Downloads 6969
Data volume 123.1 MB123.1 MB
Unique views 4040
Unique downloads 6666
More info on how stats are collected.
Indexed in
Publication date:
September 27, 2019
DOI:
10.5281/zenodo.3517166

Zenodo DOI Badge

DOI 

10.5281/zenodo.3517166

Markdown 

[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.3517166.svg)](https://doi.org/10.5281/zenodo.3517166)

reStructedText 

.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.3517166.svg
   :target: https://doi.org/10.5281/zenodo.3517166

HTML 

<a href="https://doi.org/10.5281/zenodo.3517166"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.3517166.svg" alt="DOI"></a>

Image URL 

https://zenodo.org/badge/DOI/10.5281/zenodo.3517166.svg

Target URL 

https://doi.org/10.5281/zenodo.3517166

Keyword(s):
constraint programming matching theory decomposition theory
Grants:
European Commission:
  • InnoRenew CoE - Renewable materials and healthy environments research and innovation centre of excellence (739574)
Meeting:
15th International Symposium on Operational Research (SOR'19), Bled, Slovenia, 25-27 September 2019
Alternate identifiers:
  • 978-961-6165-55-6 (ISBN)
Communities:
License (for files):
Creative Commons Attribution 4.0 International

Versions

Version 1 10.5281/zenodo.3517166 Sep 27, 2019
Cite all versions? You can cite all versions by using the DOI 10.5281/zenodo.3517165. This DOI represents all versions, and will always resolve to the latest one. Read more.

Share

Cite as

Export