The Resource Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 13, 2000 : proceedings, Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.)
Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 13, 2000 : proceedings, Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.)
Resource Information
The item Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 13, 2000 : proceedings, Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 13, 2000 : proceedings, Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
 Summary
 This book constitutes the refereed proceedings of the 4th Italian Conference on Algorithms and Complexity, CIAC 2000, held in Rome, Italy, in March 2000. The 21 revised full papers presented were carefully reviewed and selected from 41 submissions; also included are four invited survey papers. Among the topics addressed are combinatorial optimization, graph algorithms, graph computations, complexity theory, diagram design, approximation, scheduling, sorting, computational geometry, searching, and pattern matching
 Language
 eng
 Extent
 1 online resource (viii, 315 pages)
 Contents

 On salesmen, repairmen, spiders, and other traveling agents / G. Ausiello, S. Leonardi, A. MarchettiSpaccamela
 Computing a diameterconstrained minimum spanning tree in parallel / N. Deo, A. Abdalla
 Algorithms for a simple point placement problem / J. Redstone, W.L. Ruzzo
 Duality in ATM layout problems / S. Zaks
 The independence number of random interval graphs / W.F. de la Vega
 Online strategies for backups / P. Damaschke
 Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem / H.J. Böckenhauer [and others]
 Semantical counting circuits / F. Noilhan, M. Santha
 The hardness of placing street names in a Manhattan type map / S. Seibert, W. Unger
 Labeling downtown / G. Neyer, F. Wagner
 The online dialaride problem under reasonable load / D. Hauptmeier, S.O. Krumke, J. Rambau
 The onlineTSP against fair adversaries / M. Blom [and others]
 QuickHeapsort, an efficient mix of classical sorting algorithms / D. Cantone, G. Cincotti
 Triangulations without minimumweight drawing / C.A. Wang, F.Y. Chin, B. Yang
 Faster exact solutions for MAX2SAT / J. Gramm, R. Niedermeier
 Dynamically maintaining the widest kdense corridor / S.C. Nandy, T. Harayama, T. Asano
 Reconstruction of discrete sets from three or more xrays / E. Barcucci [and others]
 Modified binary searching for static tables / D. Merlini, R. Sprugnoli, M.C. Verri
 An efficient algorithm for the approximate median selection problem / S. Battiato [and others]
 Extending the implicit computational complexity approach to the subelementary timespace classes / E. Covino, G. Pani, S. Caporaso
 Group updates for redblack trees / S. Hanke, E. SoisalonSoininen
 Approximating SVP [infinity symbol] to within almostpolynomial factors is NPhard / I. Dinur
 Convergence analysis of simulated annealingbased algorithms solving flow shop scheduling problems / K. Steinhöfel, A. Albrecht, C.K. Wong
 On the Lovász number of certain circulant graphs / V.E. Brimkov [and others]
 Speeding up pattern matching by text compression / Y. Shibata [and others]
 Isbn
 9783540465218
 Label
 Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 13, 2000 : proceedings
 Title
 Algorithms and complexity
 Title remainder
 4th Italian conference, CIAC 2000, Rome, Italy, March 13, 2000 : proceedings
 Statement of responsibility
 Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.)
 Language
 eng
 Summary
 This book constitutes the refereed proceedings of the 4th Italian Conference on Algorithms and Complexity, CIAC 2000, held in Rome, Italy, in March 2000. The 21 revised full papers presented were carefully reviewed and selected from 41 submissions; also included are four invited survey papers. Among the topics addressed are combinatorial optimization, graph algorithms, graph computations, complexity theory, diagram design, approximation, scheduling, sorting, computational geometry, searching, and pattern matching
 Cataloging source
 COO
 Dewey number
 511.8
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA9.58
 LC item number
 .I885 2000
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2000
 http://bibfra.me/vocab/lite/meetingName
 Italian Conference on Algorithms and Complexity
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorDate

 1955
 1950
 http://library.link/vocab/relatedWorkOrContributorName

 Bongiovanni, Giancarlo
 Gambosi, G.
 Petreschi, Rossella
 Series statement
 Lecture notes in computer science,
 Series volume
 1767
 http://library.link/vocab/subjectName

 Algorithms
 Computational complexity
 Algorithms
 Computational complexity
 Complexiteit
 Algoritmen
 Computerwiskunde
 Label
 Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 13, 2000 : proceedings, Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.)
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 On salesmen, repairmen, spiders, and other traveling agents / G. Ausiello, S. Leonardi, A. MarchettiSpaccamela  Computing a diameterconstrained minimum spanning tree in parallel / N. Deo, A. Abdalla  Algorithms for a simple point placement problem / J. Redstone, W.L. Ruzzo  Duality in ATM layout problems / S. Zaks  The independence number of random interval graphs / W.F. de la Vega  Online strategies for backups / P. Damaschke  Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem / H.J. Böckenhauer [and others]  Semantical counting circuits / F. Noilhan, M. Santha  The hardness of placing street names in a Manhattan type map / S. Seibert, W. Unger  Labeling downtown / G. Neyer, F. Wagner  The online dialaride problem under reasonable load / D. Hauptmeier, S.O. Krumke, J. Rambau  The onlineTSP against fair adversaries / M. Blom [and others]  QuickHeapsort, an efficient mix of classical sorting algorithms / D. Cantone, G. Cincotti  Triangulations without minimumweight drawing / C.A. Wang, F.Y. Chin, B. Yang  Faster exact solutions for MAX2SAT / J. Gramm, R. Niedermeier  Dynamically maintaining the widest kdense corridor / S.C. Nandy, T. Harayama, T. Asano  Reconstruction of discrete sets from three or more xrays / E. Barcucci [and others]  Modified binary searching for static tables / D. Merlini, R. Sprugnoli, M.C. Verri  An efficient algorithm for the approximate median selection problem / S. Battiato [and others]  Extending the implicit computational complexity approach to the subelementary timespace classes / E. Covino, G. Pani, S. Caporaso  Group updates for redblack trees / S. Hanke, E. SoisalonSoininen  Approximating SVP [infinity symbol] to within almostpolynomial factors is NPhard / I. Dinur  Convergence analysis of simulated annealingbased algorithms solving flow shop scheduling problems / K. Steinhöfel, A. Albrecht, C.K. Wong  On the Lovász number of certain circulant graphs / V.E. Brimkov [and others]  Speeding up pattern matching by text compression / Y. Shibata [and others]
 Control code
 45288538
 Dimensions
 unknown
 Extent
 1 online resource (viii, 315 pages)
 Form of item
 online
 Isbn
 9783540465218
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/3540465219
 Other physical details
 illustrations.
 Specific material designation
 remote
 System control number
 (OCoLC)45288538
 Label
 Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 13, 2000 : proceedings, Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.)
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 On salesmen, repairmen, spiders, and other traveling agents / G. Ausiello, S. Leonardi, A. MarchettiSpaccamela  Computing a diameterconstrained minimum spanning tree in parallel / N. Deo, A. Abdalla  Algorithms for a simple point placement problem / J. Redstone, W.L. Ruzzo  Duality in ATM layout problems / S. Zaks  The independence number of random interval graphs / W.F. de la Vega  Online strategies for backups / P. Damaschke  Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem / H.J. Böckenhauer [and others]  Semantical counting circuits / F. Noilhan, M. Santha  The hardness of placing street names in a Manhattan type map / S. Seibert, W. Unger  Labeling downtown / G. Neyer, F. Wagner  The online dialaride problem under reasonable load / D. Hauptmeier, S.O. Krumke, J. Rambau  The onlineTSP against fair adversaries / M. Blom [and others]  QuickHeapsort, an efficient mix of classical sorting algorithms / D. Cantone, G. Cincotti  Triangulations without minimumweight drawing / C.A. Wang, F.Y. Chin, B. Yang  Faster exact solutions for MAX2SAT / J. Gramm, R. Niedermeier  Dynamically maintaining the widest kdense corridor / S.C. Nandy, T. Harayama, T. Asano  Reconstruction of discrete sets from three or more xrays / E. Barcucci [and others]  Modified binary searching for static tables / D. Merlini, R. Sprugnoli, M.C. Verri  An efficient algorithm for the approximate median selection problem / S. Battiato [and others]  Extending the implicit computational complexity approach to the subelementary timespace classes / E. Covino, G. Pani, S. Caporaso  Group updates for redblack trees / S. Hanke, E. SoisalonSoininen  Approximating SVP [infinity symbol] to within almostpolynomial factors is NPhard / I. Dinur  Convergence analysis of simulated annealingbased algorithms solving flow shop scheduling problems / K. Steinhöfel, A. Albrecht, C.K. Wong  On the Lovász number of certain circulant graphs / V.E. Brimkov [and others]  Speeding up pattern matching by text compression / Y. Shibata [and others]
 Control code
 45288538
 Dimensions
 unknown
 Extent
 1 online resource (viii, 315 pages)
 Form of item
 online
 Isbn
 9783540465218
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/3540465219
 Other physical details
 illustrations.
 Specific material designation
 remote
 System control number
 (OCoLC)45288538
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Algorithmsandcomplexity4thItalian/fHu0w6MwJrg/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Algorithmsandcomplexity4thItalian/fHu0w6MwJrg/">Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 13, 2000 : proceedings, Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 13, 2000 : proceedings, Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Algorithmsandcomplexity4thItalian/fHu0w6MwJrg/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Algorithmsandcomplexity4thItalian/fHu0w6MwJrg/">Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 13, 2000 : proceedings, Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>