TY  - BOOK
AU  - Ausiello,G.
AU  - Lucertini,M.
ED  - Istituto di analisi dei sistemi ed informatica (Italy)
TI  - Analysis and design of algorithms for combinatorial problems
T2  - Annals of discrete mathematics
SN  - 9780444876997
AV  - QA164 .A49 1985eb
U1  - 511/.6 22
PY  - 1985///
CY  - Amsterdam, New York, New York, N.Y., U.S.A.
PB  - North-Holland, Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.
KW  - Combinatorial analysis
KW  - Data processing
KW  - Algoritmos E Estruturas De Dados
KW  - larpcal
KW  - Analise Combinatoria
KW  - fast
KW  - MATHEMATICS
KW  - Combinatorics
KW  - bisacsh
KW  - conception algorithme
KW  - combinatoire
KW  - th�eorie graphe
KW  - analyse algorithmique
KW  - analyse combinatoire
KW  - Analyse combinatoire
KW  - Congr�es
KW  - ram
KW  - Algorithmes
KW  - Math�ematiques
KW  - Logiciels
KW  - algorithmes
KW  - �etudes diverses
KW  - rero
KW  - Algorithmus
KW  - swd
KW  - Kombinatorische Analysis
KW  - Algorithms
KW  - Electronic books
N1  - "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; 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; Electronic reproduction; [S.l.]; HathiTrust Digital Library; 2011
N2  - 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
UR  - http://www.sciencedirect.com/science/book/9780444876997
UR  - http://www.sciencedirect.com/science/publication?issn=03040208&volume=109
ER  -