The Minimum Spanning Tree Constraint-Reference-Cited by-同舟云学术

The Minimum Spanning Tree Constraint

Published:2006 Issue: Volume: Page:152-166
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming - CP 2006
language:
Short-container-title:

Author:

Dooms Grégoire,Katriel Irit

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11889205_13.pdf

Reference18 articles.

1. Aron, I.D., Van Hentenryck, P.: A constraint satisfaction approach to the robust spanning tree problem with interval data. In: UAI, pp. 18–25 (2002)

2. Lecture Notes in Computer Science;N. Beldiceanu,2005

3. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)

4. Lecture Notes in Computer Science;G. Dooms,2005

5. Dooms, G., Katriel, I.: Graph constraints in constraint programming: Weighted spanning trees. Research Report 2006-1, INGI, Belgium (2006)

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Privacy Issues in mHealth Systems Using Blockchain;Lecture Notes in Networks and Systems;2022

2. Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2019

3. The Weighted Arborescence Constraint;Integration of AI and OR Techniques in Constraint Programming;2017

4. Counting Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems;Integration of AI and OR Techniques in Constraint Programming;2017

5. SAT Modulo Graphs: Acyclicity;Logics in Artificial Intelligence;2014