Data Structures for Combinatorial Problems

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


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.


Combinatorial Problem Array Form Adjacency List Comprehensive Presentation Extreme Vector 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E.HOROWITZ and S.SAHNI: Fundamentals of Data Structures. Pitman, London 1977.Google Scholar
  2. [2]
    H.FREEMAN: The floating currency problem. Unpublished manuscript. Google Scholar
  3. [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. [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. [5]
    M.R.GAREY and D.S.JOHNSON: Computers and Intractability. Freeman and Co., San Francisco 1979.MATHGoogle Scholar
  6. [6]
    D.E.KNUTH: The Art of Computer Programming. Vol. 3. Addison-Wesley, Reading 1973.Google Scholar
  7. [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.CrossRefGoogle Scholar
  8. [8]
    Y.A.IKRIUKOV: Optimal Algorithms of Definition of Pareto Optimal Set. Proc. Tenth International Symposium on Mathematical Programming, Montreal 1979.Google Scholar

Copyright information

© Springer-Verlag Wien 1981

Authors and Affiliations

  • Fabrizio Luccio
    • 1
  1. 1.University of PisaItaly

Personalised recommendations