Skip to main content
SpringerLink
Log in

Data Structures for Combinatorial Problems

  • Chapter
Analysis and Design of Algorithms in Combinatorial Optimization

Part of the book series: International Centre for Mechanical Sciences ((CISM,volume 266))

  • 248 Accesses

Abstract

The concept of data structure is widely known. We will not attempt here to give a definition of data structure, nor to describe the semantics of the operations required by such structures. Nor we will sistematically present a way a data structure can be implemented. The reader is referred, for example, to [1] for a comprehensive presentation of the above matters. In this lecture instead, we will try to put into evidence the importance of selecting a proper data structure in the solution of a given problem, by discussing different aspects of a specific working example.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.HOROWITZ and S.SAHNI: Fundamentals of Data Structures. Pitman, London 1977.

    Google Scholar 

  2. H.FREEMAN: The floating currency problem. Unpublished manuscript.

    Google Scholar 

  3. M.L.FISHER: Worst-Case Analysis of Heuristics. In “Interfaces Between Computer Science and Operations Research”. Proceedings of a Symposium held at the Mathematisch Centrum, Amsterdam, September 7 10, 1976.

    Google Scholar 

  4. P.VAN EMDE BOAS: Developments in Data Structures. In “Interfaces Between Computer Science and Operations Research’. Proceedings of a Symposium held at the Matematisch Centrum, Amsterdam, September 7_10, 1976.

    Google Scholar 

  5. M.R.GAREY and D.S.JOHNSON: Computers and Intractability. Freeman and Co., San Francisco 1979.

    MATH  Google Scholar 

  6. D.E.KNUTH: The Art of Computer Programming. Vol. 3. Addison-Wesley, Reading 1973.

    Google Scholar 

  7. H.T.KUNG, F.LUCCIO and F.P.PREPARATA: On Finding the Maxima of a Set of Vectors. J. ACM 22, Oct. 1975, 469–476.

    Article  Google Scholar 

  8. Y.A.IKRIUKOV: Optimal Algorithms of Definition of Pareto Optimal Set. Proc. Tenth International Symposium on Mathematical Programming, Montreal 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Pisa, Italy

    Fabrizio Luccio

Authors
  1. Fabrizio Luccio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IASI-CNR, Istituto di Automatica, Università di Roma, Italy

    G. Ausiello  & M. Lucertini  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Wien

About this chapter

Cite this chapter

Luccio, F. (1981). Data Structures for Combinatorial Problems. In: Ausiello, G., Lucertini, M. (eds) Analysis and Design of Algorithms in Combinatorial Optimization. International Centre for Mechanical Sciences, vol 266. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2748-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-2748-3_4

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-81626-4

  • Online ISBN: 978-3-7091-2748-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation