Algorithms and Computation (Record no. 112921)

000 -LEADER
fixed length control field 05486nam a22005895i 4500
001 - CONTROL NUMBER
control field 978-3-642-17514-5
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140220084551.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 101203s2010 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642175145
-- 978-3-642-17514-5
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-642-17514-5
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.A43
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMB
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM051300
Source bisacsh
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Cheong, Otfried.
Relator term editor.
245 10 - TITLE STATEMENT
Title Algorithms and Computation
Medium [electronic resource] :
Remainder of title 21st International Symposium, ISAAC 2010, Jeju, Korea, December 15-17, 2010, Proceedings, Part II /
Statement of responsibility, etc edited by Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2010.
300 ## - PHYSICAL DESCRIPTION
Extent XVIII, 474p. 96 illus.
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 6507
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Session 6A. Data Structure and Algorithm II -- D2-Tree: A New Overlay with Deterministic Bounds -- Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets -- Dynamic Range Reporting in External Memory -- A Cache-Oblivious Implicit Dictionary with the Working Set Property -- Session 6B. Graph Algorithm II -- The (p,q)-total Labeling Problem for Trees -- Drawing a Tree as a Minimum Spanning Tree Approximation -- k-cyclic Orientations of Graphs -- Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size -- Session 7A. Computational Geometry II -- Maximum Overlap of Convex Polytopes under Translation -- Approximate Shortest Homotopic Paths in Weighted Regions -- Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane -- Session 7B. Graph Coloring II -- Approximation and Hardness Results for the Maximum Edge q-coloring Problem -- 3-Colouring AT-Free Graphs in Polynomial Time -- On Coloring Graphs without Induced Forests -- Session 8A. Approximation Algorithm II -- On the Approximability of the Maximum Interval Constrained Coloring Problem -- Approximability of Constrained LCS -- Approximation Algorithms for the Multi-Vehicle Scheduling Problem -- On Greedy Algorithms for Decision Trees -- Session 8B. Online Algorithm -- Single and Multiple Device DSA Problem, Complexities and Online Algorithms -- The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications -- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing -- On the Continuous CNN Problem -- Session 9A. Scheduling -- Policies for Periodic Packet Routing -- Increasing Speed Scheduling and Flow Scheduling -- A Tighter Analysis of Work Stealing -- Approximating the Traveling Tournament Problem with Maximum Tour Length 2 -- Session 9B. Data Structure and Algorithm III -- Alphabet Partitioning for Compressed Rank/Select and Applications -- Entropy-Bounded Representation of Point Grids -- Identifying Approximate Palindromes in Run-Length Encoded Strings -- Session 10A. Graph Algorithm III -- Minimum Cost Partitions of Trees with Supply and Demand -- Computing the (t,k)-Diagnosability of Component-Composition Graphs and Its Application -- Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs -- Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization -- Induced Subgraph Isomorphism on Interval and Proper Interval Graphs -- Session 10B. Computational Geometry III -- Testing Simultaneous Planarity When the Common Graph Is 2-Connected -- Computing the Discrete Fréchet Distance with Imprecise Input -- Connectivity Graphs of Uncertainty Regions -- ?/2-Angle Yao Graphs Are Spanners -- Identifying Shapes Using Self-assembly.
520 ## - SUMMARY, ETC.
Summary, etc This book constitutes the refereed proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC 2010, held in Jeju, South Korea in December 2010. The 77 revised full papers presented were carefully reviewed and selected from 182 submissions for inclusion in the book. This volume contains topics such as approximation algorithm; complexity; data structure and algorithm; combinatorial optimization; graph algorithm; computational geometry; graph coloring; fixed parameter tractability; optimization; online algorithm; and scheduling.
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 Networks.
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 Computer software.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Electronic data processing.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computational complexity.
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 Algorithm Analysis and Problem Complexity.
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 Computer Graphics.
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 Numeric Computing.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Chwa, Kyung-Yong.
Relator term editor.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Park, Kunsoo.
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 9783642175138
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
-- 0302-9743 ;
Volume number/sequential designation 6507
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-17514-5
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-LNC

No items available.

2017 | The Technical University of Kenya Library | +254(020) 2219929, 3341639, 3343672 | library@tukenya.ac.ke | Haile Selassie Avenue