The Resource Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 1-3, 2000 : proceedings, Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.), (electronic resource)

Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 1-3, 2000 : proceedings, Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.), (electronic resource)

Label
Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 1-3, 2000 : proceedings
Title
Algorithms and complexity
Title remainder
4th Italian conference, CIAC 2000, Rome, Italy, March 1-3, 2000 : proceedings
Statement of responsibility
Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.)
Creator
Contributor
Subject
Genre
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
Member of
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 1-3, 2000 : proceedings, Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.), (electronic resource)
Link
http://dx.doi.org/10.1007/3-540-46521-9
Instantiates
Publication
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. Marchetti-Spaccamela -- Computing a diameter-constrained 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 dial-a-ride problem under reasonable load / D. Hauptmeier, S.O. Krumke, J. Rambau -- The online-TSP against fair adversaries / M. Blom [and others] -- QuickHeapsort, an efficient mix of classical sorting algorithms / D. Cantone, G. Cincotti -- Triangulations without minimum-weight drawing / C.A. Wang, F.Y. Chin, B. Yang -- Faster exact solutions for MAX2SAT / J. Gramm, R. Niedermeier -- Dynamically maintaining the widest k-dense corridor / S.C. Nandy, T. Harayama, T. Asano -- Reconstruction of discrete sets from three or more x-rays / 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 sub-elementary time-space classes / E. Covino, G. Pani, S. Caporaso -- Group updates for red-black trees / S. Hanke, E. Soisalon-Soininen -- Approximating SVP [infinity symbol] to within almost-polynomial factors is NP-hard / I. Dinur -- Convergence analysis of simulated annealing-based 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]
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 physical details
illustrations.
Specific material designation
remote
System control number
  • (OCoLC)45288538
  • (OCoLC)ocm45288538
Label
Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 1-3, 2000 : proceedings, Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.), (electronic resource)
Link
http://dx.doi.org/10.1007/3-540-46521-9
Publication
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. Marchetti-Spaccamela -- Computing a diameter-constrained 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 dial-a-ride problem under reasonable load / D. Hauptmeier, S.O. Krumke, J. Rambau -- The online-TSP against fair adversaries / M. Blom [and others] -- QuickHeapsort, an efficient mix of classical sorting algorithms / D. Cantone, G. Cincotti -- Triangulations without minimum-weight drawing / C.A. Wang, F.Y. Chin, B. Yang -- Faster exact solutions for MAX2SAT / J. Gramm, R. Niedermeier -- Dynamically maintaining the widest k-dense corridor / S.C. Nandy, T. Harayama, T. Asano -- Reconstruction of discrete sets from three or more x-rays / 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 sub-elementary time-space classes / E. Covino, G. Pani, S. Caporaso -- Group updates for red-black trees / S. Hanke, E. Soisalon-Soininen -- Approximating SVP [infinity symbol] to within almost-polynomial factors is NP-hard / I. Dinur -- Convergence analysis of simulated annealing-based 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]
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 physical details
illustrations.
Specific material designation
remote
System control number
  • (OCoLC)45288538
  • (OCoLC)ocm45288538

Library Locations

  • Architecture LibraryBorrow it
    Gould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US
    35.205706 -97.445050
  • Bizzell Memorial LibraryBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Boorstin CollectionBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Chinese Literature Translation ArchiveBorrow it
    401 W. Brooks St., RM 414, Norman, OK, 73019, US
    35.207487 -97.447906
  • Engineering LibraryBorrow it
    Felgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US
    35.205706 -97.445050
  • Fine Arts LibraryBorrow it
    Catlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US
    35.210371 -97.448244
  • Harry W. Bass Business History CollectionBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • History of Science CollectionsBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • John and Mary Nichols Rare Books and Special CollectionsBorrow it
    401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • Library Service CenterBorrow it
    2601 Technology Place, Norman, OK, 73019, US
    35.185561 -97.398361
  • Price College Digital LibraryBorrow it
    Adams Hall 102 307 West Brooks St., Norman, OK, 73019, US
    35.210371 -97.448244
  • Western History CollectionsBorrow it
    Monnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US
    35.209584 -97.445414
Processing Feedback ...