FEEDBACK Smiley face

Algorithms — ESA '97 (Record no. 14359)

000 -LEADER
fixed length control field 05224nam a22006255i 4500
001 - CONTROL NUMBER
control field 978-3-540-69536-3
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20170515111448.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 121227s1997 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540695363
-- 978-3-540-69536-3
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/3-540-63397-9
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA75.5-76.95
072 #7 - SUBJECT CATEGORY CODE
Subject category code UY
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYA
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM014000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM031000
Source bisacsh
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0151
Edition number 23
245 10 - TITLE STATEMENT
Title Algorithms — ESA '97
Medium [electronic resource] :
Remainder of title 5th Annual European Symposium Graz, Austria, September 15–17, 1997 Proceedings /
Statement of responsibility, etc edited by Rainer Burkard, Gerhard Woeginger.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 1997.
300 ## - PHYSICAL DESCRIPTION
Extent XII, 524 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 0302-9743 ;
Volume number/sequential designation 1284
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Scheduling independent multiprocessor tasks -- On local search for weighted ?-set packing -- On-line machine covering -- Area-efficient static and incremental graph drawings -- Denesting by bounded degree radicals -- a linear time algorithm for the arc disjoint Menger problem in planar directed graphs -- Distance approximating trees for chordal and dually chordal graphs -- Decomposition of integer programs and of generating sets -- Bounded degree spanning trees -- Optimal adaptive broadcasting with a bounded fraction of faulty nodes -- Weighted graph separators and their applications -- A new exact algorithm for general orthogonal d-dimensional knapsack problems -- Dynamic data structures for realtime management of large geometric scenes -- Solving rectilinear Steiner tree problems exactly in theory and practice -- Dynamically switching vertices in planar graphs -- A new family of randomized algorithms for list accessing -- On-line construction of two-dimensional suffix trees -- Scheduling multiclass queueing networks on parallel servers: Approximate and heavy-traffic optimality of Klimov's priority rule -- Optimal reconstruction of graphs under the additive model -- Fixing variables in semidefinite relaxations -- Test sets of the knapsack problem and simultaneous diophantine approximation -- Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing -- Fault-tolerant real-time scheduling -- Collecting garbage pages in a distributed shared memory with reduced memory and communication overhead -- Quasi-fully dynamic algorithms for two-connectivity, cycle equivalence and related problems -- Minimum spanning trees in d dimensions -- Relaxed balance for search trees with local rebalancing -- Improved approximations for minimum cardinality quadrangulations of finite element meshes -- Dynamic storage allocation with known durations -- Coloring in sublinear time -- Competitive analysis of on-line stack-up algorithms -- Scheduling-LPs bear probabilities randomized approximations for min-sum criteria -- On piercing sets of axis-parallel rectangles and rings -- Seven problems: So different yet close -- Linear-time reconstruction of Delaunay triangulations with applications -- Approximating satisfiable satisfiability problems -- Algorithms for computing signs of 2 x 2 determinants: Dynamics and average-case analysis -- Reconstructing the topology of a CAD model - A discrete approach -.
520 ## - SUMMARY, ETC.
Summary, etc This book constitutes the refereed proceedings of the 5th Annual International European Symposium on Algorithms, ESA'97, held in Graz, Austria, September 1997. The 38 revised full papers presented were selected from 112 submitted papers. The papers address a broad spectrum of theoretical and applicational aspects in algorithms theory and design. Among the topics covered are approximation algorithms, graph and network algorithms, combinatorial optimization, computational biology, computational mathematics, data compression, distributed computing, evolutionary algorithms, neural computing, online algorithms, parallel computing, pattern matching, and others.
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 Computer communication systems.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computers.
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
General subdivision Mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer graphics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Combinatorics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Science.
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 Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Graphics.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Communication Networks.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Combinatorics.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Burkard, Rainer.
Relator term editor.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Woeginger, Gerhard.
Relator term editor.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783540633976
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
-- 0302-9743 ;
Volume number/sequential designation 1284
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/3-540-63397-9
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-LNC
912 ## -
-- ZDB-2-BAE
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Koha item type e-Book

No items available.


© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in