Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Algorithm Engineering

WAE 1999: Algorithm Engineering pp 1–11Cite as

Selecting Problems for Algorithm Evaluation

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1668))

Abstract

In this paper we address the issue of developing test sets for computational evaluation of algorithms. We discuss both test families for comparing several algorithms and selecting one to use in an application, and test families for predicting algorithm performance in practice.

This is a preview of subscription content, 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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Barr, B. Golden, J. Kelly, M. Resende, and W. Stewart. Designing and Reporting on Computational Experiments with Heuristic Methods. J. Heuristics, 1:9–32, 1995.

    Article  Google Scholar 

  2. R. E. Bellman. On a Routing Problem. Quart. Appl. Math., 16:87–90, 1958.

    Article  MathSciNet  Google Scholar 

  3. D. P. Bertsekas and P. Tseng. Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems. Oper. Res., 36:93–114, 1988.

    Article  MathSciNet  Google Scholar 

  4. C. S. Chekuri, A. V. Goldberg D. R. Karger, M. S. Levine, and C. Stein. Experimental Study of Minimum Cut Algorithms. In Proc. 8th ACM-SIAM Symposium on Discrete Algorithms, pages 324–333, 1997.

    Google Scholar 

  5. J. Cheriyan and S. N. Maheshwari. Analysis of Preflow Push Algorithms for Maximum Network Flow. SIAM J. Comput., 18:1057–1086, 1989.

    Article  MathSciNet  Google Scholar 

  6. B. V. Cherkassky and A. V. Goldberg. On Implementing Push-Relabel Method for the Maximum Flow Problem. Algorithmica, 19:390–410, 1997.

    Article  MathSciNet  Google Scholar 

  7. B. V. Cherkassky, A. V. Goldberg, and T. Radzik. Shortest Paths Algorithms: Theory and Experimental Evaluation. Math. Prog., 73:129–174, 1996.

    MathSciNet  MATH  Google Scholar 

  8. E. W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numer. Math., 1:269–271, 1959.

    Article  MathSciNet  Google Scholar 

  9. N. Eiron, M. Rodeh, and I. Steinwarts. Matrix Multiplication: A Case Study of Algorithm Engineering. In Proc. 2-nd Workshop on Algorithm Engineering, Saarbruken, Germany, pages 98–109, 1998.

    Google Scholar 

  10. R.E. Erickson, C.L. Monma, and A.F. Veinott Jr. Send-and-split method for minimum-concave-cost network flows. Math. of Oper. Res., 12:634–664, 1979.

    Article  MathSciNet  Google Scholar 

  11. L. R. Ford, Jr. and D. R. Fulkerson. Flows in Networks. Princeton Univ. Press, Princeton, NJ, 1962.

    MATH  Google Scholar 

  12. A. V. Goldberg and M. Kharitonov. On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost Flow Problem. In D. S. Johnson and C. C. McGeoch, editors, Network Flows and Matching: First DIMACS Implementation Challenge (Refereed Proceedings), pages 157–198. AMS, 1993.

    Google Scholar 

  13. A. V. Goldberg and B. M. E. Moret. Combinatorial Algorithms Test Sets (CATS): The ACM/EATCS Platform for Experimental Research. In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms, pages S913–S914, 1999.

    Google Scholar 

  14. M. D. Grigoriadis and Y. Hsu. The Rutgers Minimum Cost Network Flow Subroutines. SIGMAP Bulletin of the ACM, 26:17–18, 1979.

    Google Scholar 

  15. D. Gusfield. University of california at davis. personal communication. 1996.

    Google Scholar 

  16. D. B. Johnson. How to do Experiments. Unpublished manuscript, AT&T Laboratories, 1996.

    Google Scholar 

  17. D. Klingman, A. Napier, and J. Stutz. Netgen: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems. Management Science, 20:814–821, 1974.

    Article  Google Scholar 

  18. D. Knuth. The Stanford GraphBase. ACM Press, New York, NY. and Addison-Wesley, Reading, MA, 1993.

    MATH  Google Scholar 

  19. A. LaMarca and R. E. Ladner. The Influence of Caches on the Performance of Heaps. ACM Jour. of Experimental Algorithmics, 1, 1996.

    Google Scholar 

  20. T. Leong, P. Shor, and C. Stein. Implementation of a Combinatorial Multicommodity Flow Algorithm. In D. S. Johnson and C. C. McGeoch, editors, Network Flows and Matching: First DIMACS Implementation Challenge (Refereed Proceedings), pages 387–406. AMS, 1993.

    Google Scholar 

  21. M. S. Levine. Experimental Study of Minimum Cut Algorithms. Technical Report MIT-LCS-TR-719, MIT Lab for Computer Science, 1997.

    Google Scholar 

  22. B. Ju. Levit and B. N. Livshits. Nelineinye Setevye Transportnye Zadachi. Transport, Moscow, 1972. In Russian.

    Google Scholar 

  23. C. McGeoch. Towards an Experimental Method for Algorithm Simulation. INFORMS J. Comp., 8:1–15, 1996.

    Article  Google Scholar 

  24. A. A. Middleton. Numerical Result for the Ground-State Interface in Random Medium. Phys. Rev. E, 52:R3337–R3340, 1995.

    Article  Google Scholar 

  25. E. F. Moore. The Shortest Path Through a Maze. In Proc. of the Int. Symp. On the Theory of Switching, pages 285–292. Harvard University Press, 1959.

    Google Scholar 

  26. B. M. E. Moret and H. D. Shapiro. An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree. In DIMACS Monographs in Discrete Mathematics and Theoretical Computer Science 15, pages 99–117, 1994.

    Google Scholar 

  27. B. M.E. Moret and H. D. Shapiro. On Minimizing a Set of Tests. SIAM J. Sceintific & Statistical Comp., 6:983–1003, 1985.

    Article  Google Scholar 

  28. A. T. Ogielski. Integer Optimization and Zero-Temperature Fixed Point in Ising Random-Field Systems. Physical Review Lett., 57:1251–1254, 1986.

    Article  Google Scholar 

  29. S. Pallottino. Shortest-Path Methods: Complexity, Interrelations and New Propositions. Networks, 14:257–267, 1984.

    Article  Google Scholar 

  30. U. Pape. Implementation and Efficiency of Moore Algorithms for the Shortest Root Problem. Math. Prog., 7:212–222, 1974.

    Article  MathSciNet  Google Scholar 

  31. S. Roy and I. Cox. A Maximum-Flow Formulation to the Stereo Correspondence Problem. In Proc. Int. Conf. on Computer Vision (ICCV’ 98), Bombay, India, pages 492–499, 1998.

    Google Scholar 

  32. F. B. Zhan and C. E. Noon. Shortest Path Algorithms: An Evaluation using Real Road Networks. Transp. Sci., 32:65–73, 1998.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. InterTrust STAR Lab., 460 Oakmead Parkway, Sunnyvale, CA 94086, USA

    Andrew V. Goldberg

Authors
  1. Andrew V. Goldberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Duke University, Box 90129, Durham, NC, 27708-0129, USA

    Jeffrey S. Vitter

  2. Department of Computer Science, University of London, King’s College, Strand, London, WC2R 2LS, UK

    Christos D. Zaroliagis

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goldberg, A.V. (1999). Selecting Problems for Algorithm Evaluation. In: Vitter, J.S., Zaroliagis, C.D. (eds) Algorithm Engineering. WAE 1999. Lecture Notes in Computer Science, vol 1668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48318-7_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-48318-7_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66427-7

  • Online ISBN: 978-3-540-48318-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation