Name
Abstract | ||
|---|---|---|
The Steiner Tree Problem is a well know NP-complete problem that is well studied and for which fast algorithms are already available. Nonetheless, in the real world the Steiner Tree Problem is almost always accompanied by side constraints which means these approaches cannot be applied. For many problems with side constraints, only approximation algorithms are known. We introduce here a propagator for the tree constraint with explanations, as well as lower bounding techniques and a novel constraint programming approach for the Steiner Tree Problem and two of its variants. We find our propagators with explanations are highly advantageous when it comes to solving variants of this problem. |
Year | Venue | Field |
|---|---|---|
2016 | AAAI | Approximation algorithm,Mathematical optimization,Steiner tree problem,Computer science,Constraint programming,Constraint satisfaction dual problem,Almost surely,Bounding overwatch |
DocType | Citations | PageRank |
Conference | 3 | 0.40 |
References | Authors | |
15 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Diego de Uña | 1 | 4 | 0.78 |
| Graeme Gange | 2 | 137 | 24.27 |
| Peter Schachte | 3 | 256 | 22.76 |
| Peter J. Stuckey | 4 | 4368 | 457.58 |