FEEDBACK Smiley face

Algorithms - ESA 2003 (Record no. 15739)

000 -LEADER
fixed length control field 06265nam a22006015i 4500
001 - CONTROL NUMBER
control field 978-3-540-39658-1
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20170515111548.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 121227s2003 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540396581
-- 978-3-540-39658-1
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/b13632
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.758
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMZ
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code UL
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM051230
Source bisacsh
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 23
245 10 - TITLE STATEMENT
Title Algorithms - ESA 2003
Medium [electronic resource] :
Remainder of title 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003. Proceedings /
Statement of responsibility, etc edited by Giuseppe Di Battista, Uri Zwick.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2003.
300 ## - PHYSICAL DESCRIPTION
Extent XIV, 790 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 2832
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited Lectures -- Sublinear Computing -- Authenticated Data Structures -- Approximation Algorithms and Network Games -- Contributed Papers: Design and Analysis Track -- I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries -- Line System Design and a Generalized Coloring Problem -- Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties -- Scheduling for Flow-Time with Admission Control -- On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows -- Semi-clairvoyant Scheduling -- Algorithms for Graph Rigidity and Scene Analysis -- Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting -- Multi-player and Multi-round Auctions with Severely Bounded Communication -- Network Lifetime and Power Assignment in ad hoc Wireless Networks -- Disjoint Unit Spheres admit at Most Two Line Transversals -- An Optimal Algorithm for the Maximum-Density Segment Problem -- Estimating Dominance Norms of Multiple Data Streams -- Smoothed Motion Complexity -- Kinetic Dictionaries: How to Shoot a Moving Target -- Deterministic Rendezvous in Graphs -- Fast Integer Programming in Fixed Dimension -- Correlation Clustering – Minimizing Disagreements on Arbitrary Weighted Graphs -- Dominating Sets and Local Treewidth -- Approximating Energy Efficient Paths in Wireless Multi-hop Networks -- Bandwidth Maximization in Multicasting -- Optimal Distance Labeling for Interval and Circular-Arc Graphs -- Improved Approximation of the Stable Marriage Problem -- Fast Algorithms for Computing the Smallest k-Enclosing Disc -- The Minimum Generalized Vertex Cover Problem -- An Approximation Algorithm for MAX-2-SAT with Cardinality Constraint -- On-Demand Broadcasting Under Deadline -- Improved Bounds for Finger Search on a RAM -- The Voronoi Diagram of Planar Convex Objects -- Buffer Overflows of Merging Streams -- Improved Competitive Guarantees for QoS Buffering -- On Generalized Gossiping and Broadcasting -- Approximating the Achromatic Number Problem on Bipartite Graphs -- Adversary Immune Leader Election in ad hoc Radio Networks -- Universal Facility Location -- A Method for Creating Near-Optimal Instances of a Certified Write-All Algorithm -- I/O-Efficient Undirected Shortest Paths -- On the Complexity of Approximating TSP with Neighborhoods and Related Problems -- A Lower Bound for Cake Cutting -- Ray Shooting and Stone Throwing -- Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs -- Binary Space Partition for Orthogonal Fat Rectangles -- Sequencing by Hybridization in Few Rounds -- Efficient Algorithms for the Ring Loading Problem with Demand Splitting -- Seventeen Lines and One-Hundred-and-One Points -- Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves -- Contributed Papers: Engineering and Application Track -- Streaming Geometric Optimization Using Graphics Hardware -- An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals -- Experiments on Graph Clustering Algorithms -- More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling -- The Minimum Shift Design Problem: Theory and Practice -- Loglog Counting of Large Cardinalities -- Packing a Trunk -- Fast Smallest-Enclosing-Ball Computation in High Dimensions -- Automated Generation of Search Tree Algorithms for Graph Modification Problems -- Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation -- Fleet Assignment with Connection Dependent Ground Times -- A Practical Minimum Spanning Tree Algorithm Using the Cycle Property -- The Fractional Prize-Collecting Steiner Tree Problem on Trees -- Algorithms and Experiments for the Webgraph -- Finding Short Integral Cycle Bases for Cyclic Timetabling -- Slack Optimization of Timing-Critical Nets -- Multisampling: A New Approach to Uniform Sampling and Approximate Counting -- Multicommodity Flow Approximation Used for Exact Graph Partitioning -- A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs -- Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs.
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 Software engineering.
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 File organization (Computer science).
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 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 Software Engineering/Programming and Operating Systems.
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 Data Structures.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Files.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematics of Computing.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Graphics.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Battista, Giuseppe Di.
Relator term editor.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Zwick, Uri.
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 9783540200642
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
-- 0302-9743 ;
Volume number/sequential designation 2832
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/b13632
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