Analysis and design of algorithms for combinatorial problems [electronic resource] / edited by G. Ausiello and M. Lucertini.

Contributor(s): Ausiello, G. (Giorgio), 1941- | Lucertini, M. (Mario) | Istituto di analisi dei sistemi ed informatica (Italy)Material type: Text

TextSeries: Annals of discrete mathematics ; 25. | North-Holland mathematics studies ; 109.Publication details: Amsterdam ; New York : New York, N.Y., U.S.A. : North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1985. Description: 1 online resource (x, 319 p.) : illContent type: text Media type: computer Carrier type: online resourceISBN: 9780444876997; 0444876995; 9780080872209 (electronic bk.); 0080872204 (electronic bk.); 1281788279; 9781281788276Subject(s): Combinatorial analysis -- Data processing | Algoritmos E Estruturas De Dados | Analise Combinatoria | Combinatorial analysis -- Data processing | MATHEMATICS -- Combinatorics | conception algorithme | combinatoire | th�eorie graphe | analyse algorithmique | analyse combinatoire | Analyse combinatoire -- Congr�es | Algorithmes -- Congr�es | Math�ematiques -- Logiciels -- Congr�es | algorithmes -- analyse combinatoire -- �etudes diverses | Algorithmus | Kombinatorische Analysis | Combinatorial analysis AlgorithmsGenre/Form: Electronic books.Additional physical formats: Print version:: Analysis and design of algorithms for combinatorial problems.DDC classification: 511/.6 LOC classification: QA164 | .A49 1985ebOnline resources: ScienceDirect | Volltext

Contents:

Strongly equivalent directed hypergraphs / G. Ausiello. A. d 'Atri and D. Sacc�a -- A local-ratio theorem for approximating the weighted vertex cover problem / R. Bar Yehuda and S. Even -- Dynamic programming parallel procedures for SIMD architectures / P. Bertolazzi -- Simulations among classes of random access machines and equivalence among numbers succinctly represented / A. Bertoni, G. Mauri and N. Sabadini -- A realistic approach to VLSI relational data-base processing / M.A. Bonucelli ... [et al.] -- On counting BECS / R Casas, J. D�iaz and M. Verg�es -- Rigid extensions of graph maps / I.S. Filotti -- Algebraic methods for trie statistics / Ph. Flajolet, M. Regnier and D. Sotteau -- Easy solutions for the K-center problem or the dominating set problem on random graphs / D.S. Hochbaum -- Network design with multiple demand : a new approach / M. Lucertini and G. Paletta -- How to find long paths efficiently / B. Monien -- Compact channel routing of multiterminal nets / M. Sarrafzadeh and F.P. Preparata -- Consistency of quadratic boolean equations and the K�onig-Egerv�ary property for graphs / B. Simeone -- On some relationships between combinatorics and probabilistic analysis / M. Talamo, A. Marchetti-Spaccamela and M. Protasi -- A threshold for multiple edge coverings in random hypergraphs / C. Vercellis.

Action note: digitized 2011 committed to preserveSummary: Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following years. During the Seventies, a large number of special purpose models were developed. The impressive growth of this field since has been strongly determined by the demand of applications and influenced by the technological increases in computing power and the availability of data and software. The availability of such basic tools has led to the feasibility of the exact or well approximate solution of large scale realistic combinatorial optimization problems and has created a number of new combinatorial problems.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 0 )
Title notes ( 11 )
Comments ( 0 )

No physical items for this record

Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following years. During the Seventies, a large number of special purpose models were developed. The impressive growth of this field since has been strongly determined by the demand of applications and influenced by the technological increases in computing power and the availability of data and software. The availability of such basic tools has led to the feasibility of the exact or well approximate solution of large scale realistic combinatorial optimization problems and has created a number of new combinatorial problems.

"Sponsored by the Institute for System Analysis and Informatics of the Italian National Research Council (IASI-CNR)."

A selected collection of papers based on the workshop held at the International Centre for Mechanical Sciences (CISM) in Udine, Italy, in Sept. 1982.

Includes bibliographical references.

Description based on print version record.

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [S.l.] : HathiTrust Digital Library, 2011. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL