Skip to main content
SpringerLink
Log in

On a Relative MaxSAT Encoding for the Steiner Tree Problem in Graphs

  • Conference paper
  • First Online:
Advances in Artificial Intelligence and Its Applications (MICAI 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9414))

Included in the following conference series:

  • 1413 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Oliveira, R.T.D., Silva, F.: Sat and maxsat encodings for trees applied to the steiner tree problem. In: 2014 Brazilian Conference on Intelligent Systems (BRACIS), pp. 192–197, October 2014

    Google Scholar 

  2. Prestwich, S.: Sat problems with chains of dependent variables. Disc. Appl. Math. 130(2), 329–350 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bryant, R.E., Velev, M.N.: Boolean satisfiability with transitivity constraints. ACM Trans. Comput. Logic 3(4), 604–627 (2002)

    Article  MathSciNet  Google Scholar 

  4. Velev, M.N., Gao, P.: Design of parallel portfolios for sat-based solving of hamiltonian cycle problems. In: International Symposium on Artificial Intelligence and Mathematics (ISAIM 2010), Fort Lauderdale, Florida, USA, January 6–8, 2010 (2010)

    Google Scholar 

  5. Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J., Bohlinger, J. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85–103. Springer, US (1972)

    Chapter  Google Scholar 

  6. Koch, T., Martin, A., Vos̈, S.: Steinlib: an updated library on steiner tree problems in graphs. Technical Report 00–37, Zuse-Institut Berlin (ZIB), November 2000

    Google Scholar 

  7. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM 5, 394–397 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  8. Biere, A.: Lingeling, plingeling and treengeling entering the sat competition 2013. In: Proceedings of SAT Competition 2013. Volume B-2013-1, University of Helsinki (2013)

    Google Scholar 

  9. Heras, F., Larrosa, J., Oliveras, A.: Minimaxsat: an efficient weighted max-sat solver. J. Artif. Intell. Res. 31, 1–32 (2008)

    MathSciNet  MATH  Google Scholar 

  10. Velev, M.N.: Exploiting hierarchy and structure to efficiently solve graph coloring as sat. In: IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2007, pp. 135–142, November 2007

    Google Scholar 

  11. Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)

    Article  Google Scholar 

  12. Yannakakis, M.: Computing the minimum fill-in is np-complete. SIAM J. Algebraic Discrete Methods 2(1), 77–79 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lengauer, T., Tarjan, R.E.: A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst. 1(1), 121–141 (1979)

    Article  MATH  Google Scholar 

  14. Narodytska, N., Bacchus, F.: Maximum satisfiability using core-guided maxsat resolution. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27–31, 2014, Québec City, pp. 2717–2723 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Informática, Universidade Federal Do Paraná, POBox 19081, Curitiba, 81531-980, Brazil

    Ricardo Tavares de Oliveira & Fabiano Silva

Authors
  1. Ricardo Tavares de Oliveira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fabiano Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ricardo Tavares de Oliveira .

Editor information

Editors and Affiliations

  1. Unidad Profesional Interdisciplinaria, México DF, Mexico

    Obdulia Pichardo Lagunas

  2. Universidad Autónoma Metropolitana, México DF, Mexico

    Oscar Herrera Alcántara

  3. Instituto de Investigaciones Eléctricas, Cuernavaca, Morelos, Mexico

    Gustavo Arroyo Figueroa

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

de Oliveira, R.T., Silva, F. (2015). On a Relative MaxSAT Encoding for the Steiner Tree Problem in Graphs. In: Pichardo Lagunas, O., Herrera Alcántara, O., Arroyo Figueroa, G. (eds) Advances in Artificial Intelligence and Its Applications. MICAI 2015. Lecture Notes in Computer Science(), vol 9414. Springer, Cham. https://doi.org/10.1007/978-3-319-27101-9_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27101-9_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27100-2

  • Online ISBN: 978-3-319-27101-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation