| 000 | 06847cam a2200961Ia 4500 | ||
|---|---|---|---|
| 001 | ocn316569868 | ||
| 003 | OCoLC | ||
| 005 | 20141103172225.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 090320s1985 ne a ob 000 0 eng d | ||
| 040 |
_aOPELS _beng _cOPELS _dOPELS _dOCLCQ _dOCLCF _dOCLCO _dDEBBG _dN$T _dIDEBK _dE7B _dMERUC _dOCLCE _dOCLCO |
||
| 019 |
_a301937017 _a646775635 _a768017410 _a823838843 _a823907198 _a824096523 _a824149303 |
||
| 020 | _a9780444876997 | ||
| 020 | _a0444876995 | ||
| 020 | _a9780080872209 (electronic bk.) | ||
| 020 | _a0080872204 (electronic bk.) | ||
| 020 | _a1281788279 | ||
| 020 | _a9781281788276 | ||
| 029 | 1 |
_aNZ1 _b15193398 |
|
| 029 | 1 |
_aDEBBG _bBV036962859 |
|
| 029 | 1 |
_aAU@ _b000048130171 |
|
| 029 | 1 |
_aDEBSZ _b407394761 |
|
| 035 |
_a(OCoLC)316569868 _z(OCoLC)301937017 _z(OCoLC)646775635 _z(OCoLC)768017410 _z(OCoLC)823838843 _z(OCoLC)823907198 _z(OCoLC)824096523 _z(OCoLC)824149303 |
||
| 037 |
_a124931:122766 _bElsevier Science & Technology _nhttp://www.sciencedirect.com |
||
| 042 | _adlr | ||
| 050 | 4 |
_aQA164 _b.A49 1985eb |
|
| 072 | 7 |
_aMAT _x036000 _2bisacsh |
|
| 072 | 7 |
_as1in _2rero |
|
| 072 | 7 |
_as2ma _2rero |
|
| 072 | 7 |
_aPBV _2bicssc |
|
| 082 | 0 | 4 |
_a511/.6 _222 |
| 049 | _aTEFA | ||
| 245 | 0 | 0 |
_aAnalysis and design of algorithms for combinatorial problems _h[electronic resource] / _cedited by G. Ausiello and M. Lucertini. |
| 260 |
_aAmsterdam ; _aNew York : _bNorth-Holland ; _aNew York, N.Y., U.S.A. : _bSole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., _c1985. |
||
| 300 |
_a1 online resource (x, 319 p.) : _bill. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 490 | 1 |
_aAnnals of discrete mathematics ; _v25 |
|
| 490 | 1 |
_aNorth-Holland mathematics studies ; _v109 |
|
| 520 | _aCombinatorial 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. | ||
| 500 | _a"Sponsored by the Institute for System Analysis and Informatics of the Italian National Research Council (IASI-CNR)." | ||
| 500 | _aA selected collection of papers based on the workshop held at the International Centre for Mechanical Sciences (CISM) in Udine, Italy, in Sept. 1982. | ||
| 504 | _aIncludes bibliographical references. | ||
| 588 | _aDescription based on print version record. | ||
| 505 | 0 | _aStrongly 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. | |
| 506 |
_3Use copy _fRestrictions unspecified _2star _5MiAaHDL |
||
| 533 |
_aElectronic reproduction. _b[S.l.] : _cHathiTrust Digital Library, _d2011. _5MiAaHDL |
||
| 538 |
_aMaster and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. _uhttp://purl.oclc.org/DLF/benchrepro0212 _5MiAaHDL |
||
| 583 | 1 |
_adigitized _c2011 _hHathiTrust Digital Library _lcommitted to preserve _2pda _5MiAaHDL |
|
| 650 | 0 |
_aCombinatorial analysis _xData processing. |
|
| 650 | 7 |
_aAlgoritmos E Estruturas De Dados. _2larpcal |
|
| 650 | 7 |
_aAnalise Combinatoria. _2larpcal |
|
| 650 | 7 |
_aCombinatorial analysis _xData processing. _2fast _0(OCoLC)fst00868963 |
|
| 650 | 7 |
_aMATHEMATICS _xCombinatorics. _2bisacsh |
|
| 650 | 4 | _aconception algorithme. | |
| 650 | 4 | _acombinatoire. | |
| 650 | 4 | _ath�eorie graphe. | |
| 650 | 4 | _aanalyse algorithmique. | |
| 650 | 4 | _aanalyse combinatoire. | |
| 650 | 7 |
_aAnalyse combinatoire _xCongr�es. _2ram |
|
| 650 | 7 |
_aAlgorithmes _xCongr�es. _2ram |
|
| 650 | 7 |
_aMath�ematiques _xLogiciels _xCongr�es. _2ram |
|
| 650 | 7 |
_aalgorithmes _xanalyse combinatoire _v�etudes diverses. _2rero |
|
| 650 | 0 | 7 |
_aAlgorithmus. _2swd |
| 650 | 0 | 7 |
_aKombinatorische Analysis. _2swd |
| 653 |
_aCombinatorial analysis _aAlgorithms |
||
| 655 | 4 | _aElectronic books. | |
| 700 | 1 |
_aAusiello, G. _q(Giorgio), _d1941- |
|
| 700 | 1 |
_aLucertini, M. _q(Mario) |
|
| 710 | 2 | _aIstituto di analisi dei sistemi ed informatica (Italy) | |
| 776 | 0 | 8 |
_iPrint version: _tAnalysis and design of algorithms for combinatorial problems. _dAmsterdam ; New York : North-Holland ; New York, N.Y., U.S.A. : Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1985 _z0444876995 _z9780444876997 _w(DLC) 84028667 _w(OCoLC)11574327 |
| 830 | 0 |
_aAnnals of discrete mathematics ; _v25. |
|
| 830 | 0 |
_aNorth-Holland mathematics studies ; _v109. |
|
| 856 | 4 | 0 |
_3ScienceDirect _uhttp://www.sciencedirect.com/science/book/9780444876997 |
| 856 | 4 |
_uhttp://www.sciencedirect.com/science/publication?issn=03040208&volume=109 _3Volltext |
|
| 938 |
_aebrary _bEBRY _nebr10259201 |
||
| 938 |
_aEBSCOhost _bEBSC _n239964 |
||
| 938 |
_aIngram Digital eBook Collection _bIDEB _n178827 |
||
| 942 | _cEB | ||
| 994 |
_aC0 _bTEF |
||
| 999 |
_c21792 _d21792 |
||