Algorithms and Computation (Record no. 94836)

000 -LEADER
fixed length control field 08352nam a22006255i 4500
001 - CONTROL NUMBER
control field 978-3-642-45030-3
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730193726.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 131212s2013 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642450303
-- 978-3-642-45030-3
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-642-45030-3
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
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMB
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 518.1
Edition number 23
245 10 - TITLE STATEMENT
Title Algorithms and Computation
Medium [electronic resource] :
Remainder of title 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings /
Statement of responsibility, etc. edited by Leizhen Cai, Siu-Wing Cheng, Tak-Wah Lam.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2013.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Berlin, Heidelberg :
Name of producer, publisher, distributor, manufacturer Springer Berlin Heidelberg :
-- Imprint: Springer,
Date of production, publication, distribution, manufacture, or copyright notice 2013.
300 ## - PHYSICAL DESCRIPTION
Extent XVIII, 747 p. 145 illus.
Other physical details online resource.
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type text file
Encoding format PDF
Source rda
490 1# - SERIES STATEMENT
Series statement Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 8283
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited Talk Paper -- Market Approach to Social Ads: The MyLikes Example and Related Problems -- Session 1A: Computational Geometry I -- Geodesic-Preserving Polygon Simplification -- Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information -- On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs -- Structure and Computation of Straight Skeletons in 3-Space -- Session 1B: Pattern Matching -- Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms -- Single and Multiple Consecutive Permutation Motif Search -- Beating O(nm) in Approximate LZW-Compressed Pattern Matching -- Less Space: Indexing for Queries with Wildcards -- Session 2A: Computational Complexity I -- On Determining Deep Holes of Generalized Reed-Solomon Codes -- Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes -- Determinantal Complexities and Field Extensions -- Session 2B: Internet and Social Network Algorithms I -- Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs -- Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs -- The Complexity of Finding a Large Subgraph under Anonymity Constraints -- Session 3A: Graph Theory and Algorithms I -- On the Number of Edges of Fan-Crossing Free Graphs -- Cops and Robbers on Intersection Graphs -- SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graph -- Hardness and Algorithms for Variants of Line Graphs of Directed Graphs -- Session 3B: Scheduling Algorithms -- Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds -- Better Bounds for Online k-Frame Throughput Maximization in Network Switches -- The Solvable Cases of a Scheduling Algorithm -- Session 4A: Computational Complexity II -- Exact Sublinear Binomial Sampling -- Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas -- Dynamic PointLabeling is Strongly PSPACE-Complete -- Unsatisfiable CNF Formulas Contain Many Conflicts -- Session 4B: Computational Geometry II -- Pursuit Evasion on Polyhedral Surfaces -- Algorithms for Tolerated Tverberg Partitions -- Abstract Voronoi Diagrams with Disconnected Regions -- Terrain Visibility with Multiple Viewpoints -- Session 5A: Graph Theory and Algorithms II -- Exact Algorithms for Maximum Independent Set -- On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs -- Testing Mutual Duality of Planar Graph -- Session 5B: Fixed-Parameter Tractable Algorithms -- Effective and Efficient Data Reduction for the Subset Interconnection Design Problem -- Myhill-Nerode Methods for Hypergraphs -- Augmenting Graphs to Minimize the Diameter -- Session 6A: Algorithms and Data Structures I -- Top-k Document Retrieval in Compact Space and Near-Optimal Time -- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers -- Trajectory-Based Dynamic Map Labeling -- Session 6B: Internet and Social Network -- Algorithms II -- Asynchronous Rumor Spreading on Random Graphs -- Unit Cost Buyback Problem -- Faster Rumor Spreading with Multiple Calls -- Session 7A: Algorithmic Game Theory -- Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy -- Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items -- New Results on the Online Pricing Problem -- Session 7B: Algorithms and Data Structures II -- RAM-Efficient External Memory Sorting -- Succinct Data Structures for Representing Equivalence Classes -- Sliding Bloom Filters -- Session 8A: Graph Theory and Algorithms III -- Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs -- Bounded Representations of Interval and Proper Interval Graphs -- Detecting and Counting Small Pattern Graphs -- An O∗(1.1939n) Time Algorithm for Minimum Weighted Dominating Induced Matching -- Session 8B: Approximation Algorithms I -- New InapproximabilityBounds for TSP -- Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise -- Tight Approximation Bounds for Connectivity with a Color-Spanning Set -- The Train Delivery Problem Revisited -- Session 9A: Computational Geometry III -- The Distance 4-Sector of Two Points Is Unique -- The Number of Different Unfoldings of Polyhedra -- Computing the Smallest Color-Spanning Axis-Parallel Square -- Session 9B: Approximation Algorithms II -- Euclidean Traveling Salesman Tours through Stochastic Neighborhoods -- Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure -- Approximate ˇCech Complex in Low and High Dimensions -- Session 10A: Computational Complexity III -- Model Counting for Formulas of Bounded Clique- Width -- Computing Plurality Points and Condorcet Points in Euclidean Space -- Computing Minimum Tile Sets to Self-assemble Color Patterns -- Session 10B: Network Algorithms -- A Probabilistic Analysis of Kademlia Networks -- Approximating the Generalized Minimum Manhattan Network Problem -- Minmax Regret 1-Facility Location on Uncertain Path Networks.
520 ## - SUMMARY, ETC.
Summary, etc. This book constitutes the refereed proceedings of the 24th International Symposium on Algorithms and Computation, ISAAC 2013, held in Hong Kong, China in December 2013. The 67 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 177 submissions for inclusion in the book. The focus of the volume in on the following topics: computation geometry, pattern matching, computational complexity, internet and social network algorithms, graph theory and algorithms, scheduling algorithms, fixed-parameter tractable algorithms, algorithms and data structures, algorithmic game theory, approximation algorithms and network algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer science
General subdivision Mathematics.
9 (RLIN) 3866
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Discrete mathematics.
9 (RLIN) 12873
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer graphics.
9 (RLIN) 4088
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Artificial intelligence
General subdivision Data processing.
9 (RLIN) 21787
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer science.
9 (RLIN) 9832
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Discrete Mathematics in Computer Science.
9 (RLIN) 31837
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Graphics.
9 (RLIN) 4088
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Data Science.
9 (RLIN) 34092
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Science.
9 (RLIN) 9832
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Cai, Leizhen.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 154310
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Cheng, Siu-Wing.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 154311
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Lam, Tak-Wah.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 154312
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
9 (RLIN) 154313
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783642450297
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783642450310
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 8283
9 (RLIN) 154314
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-642-45030-3">https://doi.org/10.1007/978-3-642-45030-3</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-Lecture Notes in CS

No items available.