Coverart for item
The Resource Algorithms and Complexity : 4th Italian Conference, CIAC 2000 Rome, Italy, March 1–3, 2000 Proceedings, edited by Giancarlo Bongiovanni, Rossella Petreschi, Giorgio Gambosi, (electronic resource)

Algorithms and Complexity : 4th Italian Conference, CIAC 2000 Rome, Italy, March 1–3, 2000 Proceedings, edited by Giancarlo Bongiovanni, Rossella Petreschi, Giorgio Gambosi, (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
edited by Giancarlo Bongiovanni, Rossella Petreschi, Giorgio Gambosi
Creator
Contributor
Editor
Provider
Subject
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
http://library.link/vocab/creatorName
Bongiovanni, Giancarlo
Image bit depth
0
LC call number
QA76.9.A43
Literary form
non fiction
http://library.link/vocab/relatedWorkOrContributorName
  • Petreschi, Rossella.
  • Gambosi, Giorgio.
  • SpringerLink
Series statement
Lecture Notes in Computer Science,
Series volume
1767
http://library.link/vocab/subjectName
  • Computer science
  • Data structures (Computer science)
  • Computer software
  • Computational complexity
  • Combinatorics
  • Computer Science
  • Algorithm Analysis and Problem Complexity
  • Computation by Abstract Devices
  • Data Structures
  • Discrete Mathematics in Computer Science
  • Combinatorics
Label
Algorithms and Complexity : 4th Italian Conference, CIAC 2000 Rome, Italy, March 1–3, 2000 Proceedings, edited by Giancarlo Bongiovanni, Rossella Petreschi, Giorgio Gambosi, (electronic resource)
Instantiates
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Invited Presentations -- On Salesmen, Repairmen, Spiders, and Other Traveling Agents -- Computing a Diameter-Constrained Minimum Spanning Tree in Parallel -- Algorithms for a Simple Point Placement Problem -- Duality in ATM Layout Problems -- Regular Presentations -- The Independence Number of Random Interval Graphs -- Online Strategies for Backups -- Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem -- Semantical Counting Circuits -- The Hardness of Placing Street Names in a Manhattan Type Map -- Labeling Downtown -- The Online Dial-a-Ride Problem under Reasonable Load -- The Online-TSP against Fair Adversaries -- QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms -- Triangulations without Minimum-Weight Drawing -- Faster Exact Solutions for Max2Sat -- Dynamically Maintaining the Widest k-Dense Corridor -- Reconstruction of Discrete Sets from Three or More X-Rays -- Modified Binary Searching for Static Tables -- An Efficient Algorithm for the Approximate Median Selection Problem -- Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes -- Group Updates for Bed-Black Trees -- Approximating SVP ? to within Almost-Polynomial Factors Is NP-Hard -- Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems -- On the Lovász Number of Certain Circulant Graphs -- Speeding Up Pattern Matching by Text Compression
Dimensions
unknown
Extent
VIII, 324 p.
File format
multiple file formats
Form of item
electronic
Isbn
9783540465218
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/3-540-46521-9
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-46521-8
Label
Algorithms and Complexity : 4th Italian Conference, CIAC 2000 Rome, Italy, March 1–3, 2000 Proceedings, edited by Giancarlo Bongiovanni, Rossella Petreschi, Giorgio Gambosi, (electronic resource)
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Invited Presentations -- On Salesmen, Repairmen, Spiders, and Other Traveling Agents -- Computing a Diameter-Constrained Minimum Spanning Tree in Parallel -- Algorithms for a Simple Point Placement Problem -- Duality in ATM Layout Problems -- Regular Presentations -- The Independence Number of Random Interval Graphs -- Online Strategies for Backups -- Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem -- Semantical Counting Circuits -- The Hardness of Placing Street Names in a Manhattan Type Map -- Labeling Downtown -- The Online Dial-a-Ride Problem under Reasonable Load -- The Online-TSP against Fair Adversaries -- QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms -- Triangulations without Minimum-Weight Drawing -- Faster Exact Solutions for Max2Sat -- Dynamically Maintaining the Widest k-Dense Corridor -- Reconstruction of Discrete Sets from Three or More X-Rays -- Modified Binary Searching for Static Tables -- An Efficient Algorithm for the Approximate Median Selection Problem -- Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes -- Group Updates for Bed-Black Trees -- Approximating SVP ? to within Almost-Polynomial Factors Is NP-Hard -- Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems -- On the Lovász Number of Certain Circulant Graphs -- Speeding Up Pattern Matching by Text Compression
Dimensions
unknown
Extent
VIII, 324 p.
File format
multiple file formats
Form of item
electronic
Isbn
9783540465218
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/3-540-46521-9
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-46521-8

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...