Data Structures for Combinatorial Problems
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  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.
KeywordsCombinatorial Problem Array Form Adjacency List Comprehensive Presentation Extreme Vector
Unable to display preview. Download preview PDF.
- E.HOROWITZ and S.SAHNI: Fundamentals of Data Structures. Pitman, London 1977.Google Scholar
- H.FREEMAN: The floating currency problem. Unpublished manuscript. Google Scholar
- 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
- 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
- D.E.KNUTH: The Art of Computer Programming. Vol. 3. Addison-Wesley, Reading 1973.Google Scholar
- Y.A.IKRIUKOV: Optimal Algorithms of Definition of Pareto Optimal Set. Proc. Tenth International Symposium on Mathematical Programming, Montreal 1979.Google Scholar