Skip to main content
SpringerLink
Log in

Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method

  • Conference paper
  • First Online:
Large-Scale Scientific Computing (LSSC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9374))

Included in the following conference series:

Abstract

In this paper we introduce a new method for speeding up parallel run times of discrete optimization problems which can be used for different problems. We propose that the variant of the Monte Carlo method, the Las Vegas method can be used for overcoming some special barriers that can occur in the course of dividing such problems. Especially the problem of maximum clique and k-clique is examined, and the new algorithm with the relevant measurements is presented.

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. Babai, L.: Monte-Carlo algorithms in graph isomorphism testing. Université de Montréal, D.M.S. No.79-10 (1979)

    Google Scholar 

  2. McCreesh, C., Prosser, P.: The shape of the search tree for the maximum clique problem, and the implications for parallel branch and bound. ACM Trans. Parallel Comput. 2(1), 1–27 (2015). http://dx.doi.org/10.1145/2742359, Article No.: 8

    Article  Google Scholar 

  3. Depolli, M., Konc, J., Rozman, K., Trobec, R., Janežič, D.: Exact parallel maximum clique algorithm for general and protein graphs. J. Chem. Inf. Model. 53(9), 2217–2228 (2013). doi:10.1021/ci4002525

    Article  Google Scholar 

  4. DIMACS (2014). ftp://dimacs.rutgers.edu/pub/challenge/graph/

  5. Sloan, N.: (2015) http://neilsloane.com/doc/graphs.html

  6. Szabo, S.: Parallel algorithms for finding cliques in a graph. J. Phys. Conf. Ser. 268, 012030 (2011)

    Article  Google Scholar 

  7. Szabo, S.: Monotonic matrices and clique search in graphs. Annales Univ. Sci. Budapest., Sect. Comp. 41, 307–322 (2013)

    MATH  Google Scholar 

  8. Ouyang, M.: How good are branching rules in DPLL? Discrete Appl. Math. 89(1–3), 281–286 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. Truchet, C., Richoux, F., Codognet, P.: Prediction of parallel speed-ups for Las Vegas algorithms. In: 42nd International Conference on Parallel Processing, ICPP 2013, pp. 160–169, Lyon, France, 1–4 October 2013. IEEE Computer Society (2013)

    Google Scholar 

Download references

Acknowledgments

We would like to thank the HPC Europe grant for the fruitful visit to Helsinki, to the Finish Computer Science Center which hosts the supercomputer Sisu on which the computations were performed. (https://research.csc.fi/sisu-supercomputer)

Author information

Authors and Affiliations

  1. Institute of Mathematics and Informatics, University of Pecs, Pecs, Hungary

    Bogdan Zavalnij

Authors
  1. Bogdan Zavalnij
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bogdan Zavalnij .

Editor information

Editors and Affiliations

  1. Bulgarian Academy of Sciences, Sofia, Bulgaria

    Ivan Lirkov

  2. Inst. of Inform. & Communication, Bulgarian Academy of Sciences, Sofia, Bulgaria

    Svetozar D. Margenov

  3. Informatics and Mathematical Modell, Technical University of Denmark, Kongens Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Zavalnij, B. (2015). Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2015. Lecture Notes in Computer Science(), vol 9374. Springer, Cham. https://doi.org/10.1007/978-3-319-26520-9_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26520-9_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26519-3

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation