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

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

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.)
Title variation
CIAC 2000, algorithms and complexity
Creator
Contributor
Subject
Genre
Language
eng
Member of
Cataloging source
DLC
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
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
Label
Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 1-3, 2000 : proceedings, Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
  • nc
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 ... [et al.] -- 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 ... [et al.] -- 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 ... [et al.] -- Modified binary searching for static tables / D. Merlini, R. Sprugnoli, M.C. Verri -- An efficient algorithm for the approximate median selection problem / S. Battiato ... [et al.] -- 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 ... [et al.] -- Speeding up pattern matching by text compression / Y. Shibata ... [et al.]
Control code
43552410
Dimensions
24 cm
Extent
viii, 315 pages
Isbn
9783540671596
Isbn Type
(softcover)
Lccn
00026349
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations
Label
Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 1-3, 2000 : proceedings, Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
  • nc
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 ... [et al.] -- 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 ... [et al.] -- 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 ... [et al.] -- Modified binary searching for static tables / D. Merlini, R. Sprugnoli, M.C. Verri -- An efficient algorithm for the approximate median selection problem / S. Battiato ... [et al.] -- 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 ... [et al.] -- Speeding up pattern matching by text compression / Y. Shibata ... [et al.]
Control code
43552410
Dimensions
24 cm
Extent
viii, 315 pages
Isbn
9783540671596
Isbn Type
(softcover)
Lccn
00026349
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations

Library Locations

    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
    • University of Missouri Libraries DepositoryBorrow it
      2908 Lemone Blvd, Columbia, MO, 65211, US
      38.919360 -92.291620
Processing Feedback ...