Coverart for item
The Resource Algorithms and data structures : 11th international symposium, WADS 2009, Banff, Canada, August 21-23, 2009 ; proceedings, Frank Dehne, Marina Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth (eds.), (electronic resource)

Algorithms and data structures : 11th international symposium, WADS 2009, Banff, Canada, August 21-23, 2009 ; proceedings, Frank Dehne, Marina Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth (eds.), (electronic resource)

Label
Algorithms and data structures : 11th international symposium, WADS 2009, Banff, Canada, August 21-23, 2009 ; proceedings
Title
Algorithms and data structures
Title remainder
11th international symposium, WADS 2009, Banff, Canada, August 21-23, 2009 ; proceedings
Statement of responsibility
Frank Dehne, Marina Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth (eds.)
Creator
Contributor
Editor
Provider
Subject
Genre
Language
eng
Summary
This book constitutes the refereed proceedings of the 11th Algorithms and Data Structures Symposium, WADS 2009, held in Banff, Canada, in August 2009. The Algorithms and Data Structures Symposium - WADS (formerly "Workshop on Algorithms and Data Structures") is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. The 49 revised full papers presented in this volume were carefully reviewed and selected from 126 submissions. The papers present original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing
Member of
Cataloging source
GW5XE
Image bit depth
0
LC call number
QA76.9.D35
LC item number
W333 2009
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2009
http://bibfra.me/vocab/lite/meetingName
WADS 2009
Nature of contents
dictionaries
NLM call number
QA 76.9.D35
http://library.link/vocab/relatedWorkOrContributorDate
  • 1960-
  • 1954-
http://library.link/vocab/relatedWorkOrContributorName
  • SpringerLink
  • Dehne, F.
  • Gavrilova, Marina L.
  • Sack, J.-R.
  • Tóth, Csaba D.
Series statement
Lecture Notes in Computer Science,
Series volume
5664
http://library.link/vocab/subjectName
  • Data structures (Computer science)
  • Computer algorithms
  • Information Storage and Retrieval
  • Algorithms
  • Computer science
  • Data structures (Computer science)
  • Computer algorithms
  • Informatique
  • Computer algorithms
  • Data structures (Computer science)
Label
Algorithms and data structures : 11th international symposium, WADS 2009, Banff, Canada, August 21-23, 2009 ; proceedings, Frank Dehne, Marina Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth (eds.), (electronic resource)
Instantiates
Publication
Note
International conference proceedings
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
On the Power of the Semi-Separated Pair Decomposition -- Plane Graphs with Parity Constraints -- Straight-Line Rectangular Drawings of Clustered Graphs -- Online Priority Steiner Tree Problems -- Connect the Dot: Computing Feed-Links with Minimum Dilation -- Minimal Locked Trees -- Approximating Transitive Reductions for Directed Networks -- 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2 -- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing -- A Distribution-Sensitive Dictionary with Low Space Overhead -- A Comparison of Performance Measures for Online Algorithms -- Delaunay Triangulation of Imprecise Points Simplified and Extended -- An Improved SAT Algorithm in Terms of Formula Length -- Shortest Path Problems on a Polyhedral Surface -- Approximation Algorithms for Buy-at-Bulk Geometric Network Design -- Rank-Sensitive Priority Queues -- Algorithms Meet Art, Puzzles, and Magic -- Skip-Splay: Toward Achieving the Unified Bound in the BST Model -- Drawing Graphs with Right Angle Crossings -- Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance -- Efficient Construction of Near-Optimal Binary and Multiway Search Trees -- On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem -- On Reconfiguration of Disks in the Plane and Related Problems -- Orientation-Constrained Rectangular Layouts -- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics -- Optimal Embedding into Star Metrics -- Online Square Packing -- Worst-Case Optimal Adaptive Prefix Coding -- New Results on Visibility in Simple Polygons -- Dynamic Graph Clustering Using Minimum-Cut Trees -- Rank-Balanced Trees -- Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments -- Reconfiguration of List Edge-Colorings in a Graph -- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs -- Two for One: Tight Approximation of 2D Bin Packing -- Fault Tolerant External Memory Algorithms -- Inspecting a Set of Strips Optimally -- A Pseudopolynomial Algorithm for Alexandrov’s Theorem -- A Scheme for Computing Minimum Covers within Simple Regions -- Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem -- Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality -- Streaming Embeddings with Slack -- Computing the Implicit Voronoi Diagram in Triple Precision -- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms -- Integer Programming: Optimization and Evaluation Are Equivalent -- Resolving Loads with Positive Interior Stresses -- On Making Directed Graphs Transitive -- Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees -- Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
Dimensions
unknown
Extent
1 online resource (x, 580 pages)
File format
multiple file formats
Form of item
  • online
  • electronic
Isbn
9783642033667
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other physical details
illustrations.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
Stock number
978-3-642-03366-7
System control number
  • (OCoLC)437347237
  • (OCoLC)ocn437347237
Label
Algorithms and data structures : 11th international symposium, WADS 2009, Banff, Canada, August 21-23, 2009 ; proceedings, Frank Dehne, Marina Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth (eds.), (electronic resource)
Publication
Note
International conference proceedings
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
On the Power of the Semi-Separated Pair Decomposition -- Plane Graphs with Parity Constraints -- Straight-Line Rectangular Drawings of Clustered Graphs -- Online Priority Steiner Tree Problems -- Connect the Dot: Computing Feed-Links with Minimum Dilation -- Minimal Locked Trees -- Approximating Transitive Reductions for Directed Networks -- 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2 -- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing -- A Distribution-Sensitive Dictionary with Low Space Overhead -- A Comparison of Performance Measures for Online Algorithms -- Delaunay Triangulation of Imprecise Points Simplified and Extended -- An Improved SAT Algorithm in Terms of Formula Length -- Shortest Path Problems on a Polyhedral Surface -- Approximation Algorithms for Buy-at-Bulk Geometric Network Design -- Rank-Sensitive Priority Queues -- Algorithms Meet Art, Puzzles, and Magic -- Skip-Splay: Toward Achieving the Unified Bound in the BST Model -- Drawing Graphs with Right Angle Crossings -- Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance -- Efficient Construction of Near-Optimal Binary and Multiway Search Trees -- On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem -- On Reconfiguration of Disks in the Plane and Related Problems -- Orientation-Constrained Rectangular Layouts -- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics -- Optimal Embedding into Star Metrics -- Online Square Packing -- Worst-Case Optimal Adaptive Prefix Coding -- New Results on Visibility in Simple Polygons -- Dynamic Graph Clustering Using Minimum-Cut Trees -- Rank-Balanced Trees -- Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments -- Reconfiguration of List Edge-Colorings in a Graph -- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs -- Two for One: Tight Approximation of 2D Bin Packing -- Fault Tolerant External Memory Algorithms -- Inspecting a Set of Strips Optimally -- A Pseudopolynomial Algorithm for Alexandrov’s Theorem -- A Scheme for Computing Minimum Covers within Simple Regions -- Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem -- Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality -- Streaming Embeddings with Slack -- Computing the Implicit Voronoi Diagram in Triple Precision -- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms -- Integer Programming: Optimization and Evaluation Are Equivalent -- Resolving Loads with Positive Interior Stresses -- On Making Directed Graphs Transitive -- Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees -- Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
Dimensions
unknown
Extent
1 online resource (x, 580 pages)
File format
multiple file formats
Form of item
  • online
  • electronic
Isbn
9783642033667
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other physical details
illustrations.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
Stock number
978-3-642-03366-7
System control number
  • (OCoLC)437347237
  • (OCoLC)ocn437347237

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...