000			05486nam a22005895i 4500
001			978-3-642-17514-5
003			DE-He213
005			20140220084551.0
007			cr nn 008mamaa
008			101203s2010 gw | s |||| 0|eng d
020			_a9783642175145 _9978-3-642-17514-5
024	7		_a10.1007/978-3-642-17514-5 _2doi
050		4	_aQA76.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
082	0	4	_a005.1 _223
100	1		_aCheong, Otfried. _eeditor.
245	1	0	_aAlgorithms and Computation _h[electronic resource] : _b21st International Symposium, ISAAC 2010, Jeju, Korea, December 15-17, 2010, Proceedings, Part II / _cedited by Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010.
300			_aXVIII, 474p. 96 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v6507
505	0		_aSession 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			_aThis 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	_aComputer science.
650		0	_aComputer Communication Networks.
650		0	_aData structures (Computer science).
650		0	_aComputer software.
650		0	_aElectronic data processing.
650		0	_aComputational complexity.
650		0	_aComputer graphics.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aComputer Communication Networks.
650	2	4	_aComputer Graphics.
650	2	4	_aData Structures.
650	2	4	_aNumeric Computing.
700	1		_aChwa, Kyung-Yong. _eeditor.
700	1		_aPark, Kunsoo. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642175138
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v6507
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-17514-5
912			_aZDB-2-SCS
912			_aZDB-2-LNC
999			_c112921 _d112921