The Resource Algorithms and computation : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 58, 2011, proceedings, Takao Asano [and others] (eds.)
Algorithms and computation : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 58, 2011, proceedings, Takao Asano [and others] (eds.)
Resource Information
The item Algorithms and computation : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 58, 2011, proceedings, Takao Asano [and others] (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Algorithms and computation : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 58, 2011, proceedings, Takao Asano [and others] (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
 Summary
 Annotation This book constitutes the refereed proceedings of the 22nd International Symposium on Algorithms and Computation, ISAAC 2011, held in Yokohama, Japan in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for inclusion in the book. This volume contains topics such as approximation algorithms; computational geometry; computational biology; computational complexity; data structures; distributed systems; graph algorithms; graph drawing and information visualization; optimization; online and streaming algorithms; parallel and external memory algorithms; parameterized algorithms; game theory and internet algorithms; randomized algorithms; and string algorithms
 Language
 eng
 Extent
 1 online resource (xvii, 775 pages)
 Contents

 Intro; Title page; Preface; Organization; Table of Contents; Invited Talk I; Algorithm Engineering for Route Planning An Update ; References; Invited Talk II; Semidefinite Programming and Approximation Algorithms: A Survey; References; Approximation Algorithms I; The School Bus Problem on Trees; Introduction; Our Results; Related Work; Preliminaries; A 4Approximation to the SBP on Trees; A 12.5Approximation to the Uncapacitated SBPR on Trees; References; Improved Approximations for BuyatBulk and ShallowLight kSteiner Trees and (k, 2)Subgraph; Introduction
 ShallowLight Steiner TreesAn O(logn)Approximation for the (k, 2)Subgraph Problem; References; Improved Approximation Algorithms for Routing Shop Scheduling; Introduction; Previous Work; Our Results and Techniques; Preliminaries; Routing Open Shop; Routing Flow Shop; References; ContractionBased Steiner Tree Approximations in Practice; Introduction; History; Contraction Framework; Algorithm Engineering; Experiments; Conclusions and Thoughts; References; Computational Geometry I; Covering and Piercing Disks with Two Centers; Introduction; Intersecting Disks with Two Centers
 Decision AlgorithmOptimization Algorithm; Covering Disks with Two Centers; The General Case; The Restricted Case; References; Generating Realistic Roofs over a Rectilinear Polygon; Introduction; Preliminaries; Properties of Realistic Roofs; Local Properties of Valleys and Ridges; Global Structure of Realistic Roofs; Enumerating Realistic Roofs and Computing Optimal Roofs; References; Computing the Visibility Polygon Using Few Variables; Introduction; Preliminaries; An O(n) Algorithm Using O(1) Variables; An O(n logr) Algorithm Using O(logr) Variables; Closing Remarks; References
 Minimizing Interference in AdHoc Networks with Bounded Communication RadiusIntroduction; Definitions and Results; Layered Nearest Neighbor Algorithm; Bounded Radius Network; Conclusion; References; Graph Algorithms; Hamiltonian Paths in the Square of a Tree; Introduction; Caterpillars and Horsetails; 2HPaths in (u, v)Horsetails; Efficient Algorithm for Horstail Queries; References; Dominating Induced Matchings for P7free Graphs in Linear Time; Introduction and Basic Notions; Simple Properties of Graphs with Dominating Induced Matching
 Structure of P7free Graphs with Dominating Induced MatchingDistance Levels with Respect to an MEdge in a P3; Edges in and between Ti and Tj, i =j; The Algorithm for the General P7free Case; Conclusion; References; Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths; Introduction; Preliminaries; SetRestricted Disjoint Paths; Contractions and Induced Minors in Chordal Graphs; Concluding Remarks; References; Recognizing Polar Planar Graphs Using New Results for Monopolarity; Introduction; Hardness Results; A 2SAT Approach and a Superclass of ChairFree Graphs
 Isbn
 9783642255915
 Label
 Algorithms and computation : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 58, 2011, proceedings
 Title
 Algorithms and computation
 Title remainder
 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 58, 2011, proceedings
 Statement of responsibility
 Takao Asano [and others] (eds.)
 Subject

 Computational complexity
 Computer Communication Networks
 Computer Science
 Computer algorithms
 Computer algorithms
 Computer algorithms  Congresses
 Computer graphics
 Computer science
 Computer software
 Computer software
 Conference papers and proceedings
 Conference papers and proceedings
 Data Structures
 Data structures (Computer science)
 Discrete Mathematics in Computer Science
 Electronic data processing
 Engineering & Applied Sciences
 Informatique
 Numeric Computing
 Algorithm Analysis and Problem Complexity
 Language
 eng
 Summary
 Annotation This book constitutes the refereed proceedings of the 22nd International Symposium on Algorithms and Computation, ISAAC 2011, held in Yokohama, Japan in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for inclusion in the book. This volume contains topics such as approximation algorithms; computational geometry; computational biology; computational complexity; data structures; distributed systems; graph algorithms; graph drawing and information visualization; optimization; online and streaming algorithms; parallel and external memory algorithms; parameterized algorithms; game theory and internet algorithms; randomized algorithms; and string algorithms
 Cataloging source
 GW5XE
 Dewey number
 005.1
 Index
 index present
 LC call number
 QA76.9.A43
 LC item number
 I83 2011
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2011
 http://bibfra.me/vocab/lite/meetingName
 ISAAC (Symposium)
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorDate
 1949
 http://library.link/vocab/relatedWorkOrContributorName
 Asano, Takao
 Series statement

 Lecture notes in computer science,
 LNCS sublibrary. SL 1, Theoretical computer science and general issues
 Series volume
 7074
 http://library.link/vocab/subjectName

 Computer algorithms
 Informatique
 Computer algorithms
 Engineering & Applied Sciences
 Computer Science
 Label
 Algorithms and computation : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 58, 2011, proceedings, Takao Asano [and others] (eds.)
 Antecedent source
 unknown
 Bibliography note
 Includes bibliographical references and author index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents

 Intro; Title page; Preface; Organization; Table of Contents; Invited Talk I; Algorithm Engineering for Route Planning An Update ; References; Invited Talk II; Semidefinite Programming and Approximation Algorithms: A Survey; References; Approximation Algorithms I; The School Bus Problem on Trees; Introduction; Our Results; Related Work; Preliminaries; A 4Approximation to the SBP on Trees; A 12.5Approximation to the Uncapacitated SBPR on Trees; References; Improved Approximations for BuyatBulk and ShallowLight kSteiner Trees and (k, 2)Subgraph; Introduction
 ShallowLight Steiner TreesAn O(logn)Approximation for the (k, 2)Subgraph Problem; References; Improved Approximation Algorithms for Routing Shop Scheduling; Introduction; Previous Work; Our Results and Techniques; Preliminaries; Routing Open Shop; Routing Flow Shop; References; ContractionBased Steiner Tree Approximations in Practice; Introduction; History; Contraction Framework; Algorithm Engineering; Experiments; Conclusions and Thoughts; References; Computational Geometry I; Covering and Piercing Disks with Two Centers; Introduction; Intersecting Disks with Two Centers
 Decision AlgorithmOptimization Algorithm; Covering Disks with Two Centers; The General Case; The Restricted Case; References; Generating Realistic Roofs over a Rectilinear Polygon; Introduction; Preliminaries; Properties of Realistic Roofs; Local Properties of Valleys and Ridges; Global Structure of Realistic Roofs; Enumerating Realistic Roofs and Computing Optimal Roofs; References; Computing the Visibility Polygon Using Few Variables; Introduction; Preliminaries; An O(n) Algorithm Using O(1) Variables; An O(n logr) Algorithm Using O(logr) Variables; Closing Remarks; References
 Minimizing Interference in AdHoc Networks with Bounded Communication RadiusIntroduction; Definitions and Results; Layered Nearest Neighbor Algorithm; Bounded Radius Network; Conclusion; References; Graph Algorithms; Hamiltonian Paths in the Square of a Tree; Introduction; Caterpillars and Horsetails; 2HPaths in (u, v)Horsetails; Efficient Algorithm for Horstail Queries; References; Dominating Induced Matchings for P7free Graphs in Linear Time; Introduction and Basic Notions; Simple Properties of Graphs with Dominating Induced Matching
 Structure of P7free Graphs with Dominating Induced MatchingDistance Levels with Respect to an MEdge in a P3; Edges in and between Ti and Tj, i =j; The Algorithm for the General P7free Case; Conclusion; References; Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths; Introduction; Preliminaries; SetRestricted Disjoint Paths; Contractions and Induced Minors in Chordal Graphs; Concluding Remarks; References; Recognizing Polar Planar Graphs Using New Results for Monopolarity; Introduction; Hardness Results; A 2SAT Approach and a Superclass of ChairFree Graphs
 Control code
 768204302
 Dimensions
 unknown
 Extent
 1 online resource (xvii, 775 pages)
 File format
 unknown
 Form of item
 online
 Isbn
 9783642255915
 Level of compression
 unknown
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642255915
 Quality assurance targets
 not applicable
 Reformatting quality
 unknown
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)768204302
 Label
 Algorithms and computation : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 58, 2011, proceedings, Takao Asano [and others] (eds.)
 Antecedent source
 unknown
 Bibliography note
 Includes bibliographical references and author index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents

 Intro; Title page; Preface; Organization; Table of Contents; Invited Talk I; Algorithm Engineering for Route Planning An Update ; References; Invited Talk II; Semidefinite Programming and Approximation Algorithms: A Survey; References; Approximation Algorithms I; The School Bus Problem on Trees; Introduction; Our Results; Related Work; Preliminaries; A 4Approximation to the SBP on Trees; A 12.5Approximation to the Uncapacitated SBPR on Trees; References; Improved Approximations for BuyatBulk and ShallowLight kSteiner Trees and (k, 2)Subgraph; Introduction
 ShallowLight Steiner TreesAn O(logn)Approximation for the (k, 2)Subgraph Problem; References; Improved Approximation Algorithms for Routing Shop Scheduling; Introduction; Previous Work; Our Results and Techniques; Preliminaries; Routing Open Shop; Routing Flow Shop; References; ContractionBased Steiner Tree Approximations in Practice; Introduction; History; Contraction Framework; Algorithm Engineering; Experiments; Conclusions and Thoughts; References; Computational Geometry I; Covering and Piercing Disks with Two Centers; Introduction; Intersecting Disks with Two Centers
 Decision AlgorithmOptimization Algorithm; Covering Disks with Two Centers; The General Case; The Restricted Case; References; Generating Realistic Roofs over a Rectilinear Polygon; Introduction; Preliminaries; Properties of Realistic Roofs; Local Properties of Valleys and Ridges; Global Structure of Realistic Roofs; Enumerating Realistic Roofs and Computing Optimal Roofs; References; Computing the Visibility Polygon Using Few Variables; Introduction; Preliminaries; An O(n) Algorithm Using O(1) Variables; An O(n logr) Algorithm Using O(logr) Variables; Closing Remarks; References
 Minimizing Interference in AdHoc Networks with Bounded Communication RadiusIntroduction; Definitions and Results; Layered Nearest Neighbor Algorithm; Bounded Radius Network; Conclusion; References; Graph Algorithms; Hamiltonian Paths in the Square of a Tree; Introduction; Caterpillars and Horsetails; 2HPaths in (u, v)Horsetails; Efficient Algorithm for Horstail Queries; References; Dominating Induced Matchings for P7free Graphs in Linear Time; Introduction and Basic Notions; Simple Properties of Graphs with Dominating Induced Matching
 Structure of P7free Graphs with Dominating Induced MatchingDistance Levels with Respect to an MEdge in a P3; Edges in and between Ti and Tj, i =j; The Algorithm for the General P7free Case; Conclusion; References; Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths; Introduction; Preliminaries; SetRestricted Disjoint Paths; Contractions and Induced Minors in Chordal Graphs; Concluding Remarks; References; Recognizing Polar Planar Graphs Using New Results for Monopolarity; Introduction; Hardness Results; A 2SAT Approach and a Superclass of ChairFree Graphs
 Control code
 768204302
 Dimensions
 unknown
 Extent
 1 online resource (xvii, 775 pages)
 File format
 unknown
 Form of item
 online
 Isbn
 9783642255915
 Level of compression
 unknown
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642255915
 Quality assurance targets
 not applicable
 Reformatting quality
 unknown
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)768204302
Subject
 Computational complexity
 Computer Communication Networks
 Computer Science
 Computer algorithms
 Computer algorithms
 Computer algorithms  Congresses
 Computer graphics
 Computer science
 Computer software
 Computer software
 Conference papers and proceedings
 Conference papers and proceedings
 Data Structures
 Data structures (Computer science)
 Discrete Mathematics in Computer Science
 Electronic data processing
 Engineering & Applied Sciences
 Informatique
 Numeric Computing
 Algorithm Analysis and Problem Complexity
Genre
Member of
 LNCS sublibrary, SL 1, Theoretical computer science and general issues
 Lecture notes in computer science, 7074
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Algorithmsandcomputation22ndInternational/eRsp035LHs/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Algorithmsandcomputation22ndInternational/eRsp035LHs/">Algorithms and computation : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 58, 2011, proceedings, Takao Asano [and others] (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Algorithms and computation : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 58, 2011, proceedings, Takao Asano [and others] (eds.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Algorithmsandcomputation22ndInternational/eRsp035LHs/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Algorithmsandcomputation22ndInternational/eRsp035LHs/">Algorithms and computation : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 58, 2011, proceedings, Takao Asano [and others] (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>