Algorithms and Complexity (Record no. 187718)

MARC details
000 -LEADER
fixed length control field 05208nam a22006735i 4500
001 - CONTROL NUMBER
control field 978-3-540-46521-8
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240423132432.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 121227s2000 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540465218
-- 978-3-540-46521-8
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/3-540-46521-9
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.6-76.66
072 #7 - SUBJECT CATEGORY CODE
Subject category code UM
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM051000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UM
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.11
Edition number 23
245 10 - TITLE STATEMENT
Title Algorithms and Complexity
Medium [electronic resource] :
Remainder of title 4th Italian Conference, CIAC 2000 Rome, Italy, March 1-3, 2000 Proceedings /
Statement of responsibility, etc edited by Giancarlo Bongiovanni, Giorgio Gambosi, Rosella Petreschi.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2000.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg :
-- Imprint: Springer,
-- 2000.
300 ## - PHYSICAL DESCRIPTION
Extent VIII, 324 p.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
International Standard Serial Number 1611-3349 ;
Volume number/sequential designation 1767
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
520 ## - SUMMARY, ETC.
Summary, etc The papers in this volume were presented at the Fourth Italian Conference on Algorithms and Complexity (CIAC 2000). The conference took place on March 1-3, 2000, in Rome (Italy), at the conference center of the University of Rome \La Sapienza". This conference was born in 1990 as a national meeting to be held every three years for Italian researchers in algorithms, data structures, complexity, and parallel and distributed computing. Due to a signi cant participation of foreign reaserchers, starting from the second conference, CIAC evolved into an international conference. In response to the call for papers for CIAC 2000, there were 41 subm- sions, from which the program committee selected 21 papers for presentation at the conference. Each paper was evaluated by at least three program committee members. In addition to the selected papers, the organizing committee invited Giorgio Ausiello, Narsingh Deo, Walter Ruzzo, and Shmuel Zaks to give plenary lectures at the conference. We wish to express our appreciation to all the authors of the submitted papers, to the program committee members and the referees, to the organizing committee, and to the plenary lecturers who accepted our invitation.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer programming.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data structures (Computer science).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Information theory.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial intelligence
General subdivision Data processing.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science
General subdivision Mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete mathematics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Programming Techniques.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data Structures and Information Theory.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Theory of Computation.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Bongiovanni, Giancarlo.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Gambosi, Giorgio.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Petreschi, Rosella.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783540671596
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783662171813
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
-- 1611-3349 ;
Volume number/sequential designation 1767
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/3-540-46521-9">https://doi.org/10.1007/3-540-46521-9</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
912 ## -
-- ZDB-2-BAE
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-CSE-Springer

No items available.

© 2024 IIIT-Delhi, library@iiitd.ac.in