Abstract
In [1] it was presented some MaxSAT encodings for trees in graphs which can be used to solve the Steiner Tree Problem. In this paper we focus exclusively on the relative encoding which was called Parental-based. We review this encoding and improve it by applying two techniques. One of them is a known improvement to encode transitivity, previously used for other relative encodings. The other one consists on deducing unit clauses from the dominance relation of the given graph. Finally, we use the improved encodings to solve relevant instances, and present experimental results.
Author supplied keywords
Cite
CITATION STYLE
De Oliveira, R. T., & Silva, F. (2015). On a relative maxsat encoding for the steiner tree problem in graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9414, pp. 422–434). Springer Verlag. https://doi.org/10.1007/978-3-319-27101-9_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
