Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource Algorithms — ESA 2002 : 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)
Algorithms — ESA 2002 : 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)
Resource Information
The item Algorithms — ESA 2002 : 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Algorithms — ESA 2002 : 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 Summary
 This book constitutes the refereed proceedings of the 10th Annual European Symposium on Algorithms, ESA 2002, held in Rome, Italy, in September 2002. The 74 revised full papers presented were carefully reviewed and selected from a total of 201 submissions. The papers address all current issues in Algorithmics, in particular computational biology, computational finance, computational geometry, databases and information retrieval, external memory algorithms, graph and network algorithms, graph drawing, algorithmic learning, network design, online algorithms, parallel and distributed computing, pattern matching, data compression, quantum computing, randomized algorithms, and symbolic computation
 Language
 eng
 Extent
 XXVIII, 919 p.
 Contents

 Invited Lectures
 Solving Traveling Salesman Problems
 Computing Shapes from Point Cloud Data
 Mechanism Design for Fun and Profit
 On Distance Oracles and Routing in Graphs
 Contributed Papers
 Kinetic Medians and kdTrees
 Range Searching in Categorical Data: Colored Range Searching on Grid
 NearLinear Time Approximation Algorithms for Curve Simplification
 Translating a Planar Object to Maximize Point Containment
 Approximation Algorithms for kLine Center
 New Heuristics and Lower Bounds for the MinMax kChinese Postman Problem
 SCIL — Symbolic Constraints in Integer Linear Programming
 Implementing I/Oefficient Data Structures Using TPIE
 On the kSplittable Flow Problem
 Partial Alphabetic Trees
 Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router
 Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy
 Two Simplified Algorithms for Maintaining Order in a List
 Efficient Tree Layout in a Multilevel Memory Hierarchy
 A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
 TSP with Neighborhoods of Varying Size
 1.375Approximation Algorithm for Sorting by Reversals
 Radio Labeling with Preassigned Frequencies
 BranchandBound Algorithms for the Test Cover Problem
 Constructing Plane Spanners of Bounded Degree and Low Weight
 Eager stOrdering
 ThreeDimensional Layers of Maxima
 Optimal Terrain Construction Problems and Applications in IntensityModulated Radiation Therapy
 Geometric Algorithms for DensityBased Data Clustering
 BalancedReplication Algorithms for Distribution Trees
 Butterflies and PeertoPeer Networks
 Estimating Rarity and Similarity over Data Stream Windows
 Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels
 Frequency Estimation of Internet Packet Streams with Limited Space
 Truthful and Competitive Double Auctions
 Optimal Graph Exploration without Good Maps
 Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee
 Nonindependent Randomized Rounding and an Application to Digital Halftoning
 Computing Homotopic Shortest Paths Efficiently
 An Algorithm for Dualization in Products of Lattices and Its Applications
 Determining Similarity of Conformational Polymorphs
 Minimizing the Maximum Starting Time Online
 Vector Assignment Problems: A General Framework
 Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice
 Simple and Fast: Improving a BranchAndBound Algorithm for Maximum Clique
 Online Companion Caching
 Deterministic Communication in Radio Networks with Large Labels
 A Primal Approach to the Stable Set Problem
 WideSense Nonblocking WDM CrossConnects
 Efficient Implementation of a Minimal Triangulation Algorithm
 Scheduling Malleable Parallel Tasks: An Asymptotic Fully PolynomialTime Approximation Scheme
 The Probabilistic Analysis of a Greedy Satisfiability Algorithm
 Dynamic Additively Weighted Voronoi Diagrams in 2D
 TimeExpanded Graphs for FlowDependent Transit Times
 PartiallyOrdered Knapsack and Applications to Scheduling
 A Software Library for Elliptic Curve Cryptography
 RealTime Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows
 Randomized Approximation Algorithms for Query Optimization Problems on Two Processors
 Covering Things with Things
 OnLine DialaRide Problems under a Restricted Information Model
 Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs
 Engineering a Lightweight Suffix Array Construction Algorithm
 Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations
 ExternalMemory BreadthFirst Search with Sublinear I/O
 Frequency Channel Assignment on Planar Networks
 Design and Implementation of Efficient Data Types for Static Graphs
 An Exact Algorithm for the UniformlyOriented Steiner Tree Problem
 A Fast, Accurate and Simple Method for Pricing EuropeanAsian and SavingAsian Options
 Sorting 13 Elements Requires 34 Comparisons
 Extending Reduction Techniques for the Steiner Tree Problem
 A Comparison of Multicast Pull Models
 Online Scheduling for Sorting Buffers
 Finding the Sink Takes Some Time
 Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design
 Minimizing Makespan and Preemption Costs on a System of Uniform Machines
 Minimizing the Total Completion Time Online on a Single Machine, Using Restarts
 HighLevel Filtering for Arrangements of Conic Arcs
 An Approximation Scheme for Cake Division with a Linear Number of Cuts
 A Simple Linear Time Algorithm for Finding Even Triangulations of 2Connected Bipartite Plane Graphs
 Isbn
 9783540457497
 Label
 Algorithms — ESA 2002 : 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings
 Title
 Algorithms — ESA 2002
 Title remainder
 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings
 Statement of responsibility
 edited by Rolf Möhring, Rajeev Raman
 Subject

 Electronic data processing
 Computer graphics
 Data structures (Computer science)
 Computer Graphics
 Computational complexity
 Computer software
 Computer science
 Computer science
 Algorithm Analysis and Problem Complexity
 Computer Science
 Computational complexity
 Computer Science
 Data Structures
 Algorithms
 Discrete Mathematics in Computer Science
 Data structures (Computer science)
 Numeric Computing
 Computer software
 Electronic resources
 Electronic data processing
 Algorithms
 Computer software
 Computer graphics
 Algorithms
 Computer Science
 Computer Graphics
 Computer science
 Language
 eng
 Summary
 This book constitutes the refereed proceedings of the 10th Annual European Symposium on Algorithms, ESA 2002, held in Rome, Italy, in September 2002. The 74 revised full papers presented were carefully reviewed and selected from a total of 201 submissions. The papers address all current issues in Algorithmics, in particular computational biology, computational finance, computational geometry, databases and information retrieval, external memory algorithms, graph and network algorithms, graph drawing, algorithmic learning, network design, online algorithms, parallel and distributed computing, pattern matching, data compression, quantum computing, randomized algorithms, and symbolic computation
 http://library.link/vocab/creatorName
 Möhring, Rolf
 Image bit depth
 0
 LC call number
 QA76.9.A43
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName

 Raman, Rajeev.
 SpringerLink
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 2461
 http://library.link/vocab/subjectName

 Computer science
 Data structures (Computer science)
 Computer software
 Electronic data processing
 Computational complexity
 Computer graphics
 Algorithms
 Computer Science
 Algorithm Analysis and Problem Complexity
 Discrete Mathematics in Computer Science
 Numeric Computing
 Data Structures
 Computer Graphics
 Algorithms
 Label
 Algorithms — ESA 2002 : 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)
 Antecedent source
 mixed
 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
 Invited Lectures  Solving Traveling Salesman Problems  Computing Shapes from Point Cloud Data  Mechanism Design for Fun and Profit  On Distance Oracles and Routing in Graphs  Contributed Papers  Kinetic Medians and kdTrees  Range Searching in Categorical Data: Colored Range Searching on Grid  NearLinear Time Approximation Algorithms for Curve Simplification  Translating a Planar Object to Maximize Point Containment  Approximation Algorithms for kLine Center  New Heuristics and Lower Bounds for the MinMax kChinese Postman Problem  SCIL — Symbolic Constraints in Integer Linear Programming  Implementing I/Oefficient Data Structures Using TPIE  On the kSplittable Flow Problem  Partial Alphabetic Trees  Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router  Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy  Two Simplified Algorithms for Maintaining Order in a List  Efficient Tree Layout in a Multilevel Memory Hierarchy  A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons  TSP with Neighborhoods of Varying Size  1.375Approximation Algorithm for Sorting by Reversals  Radio Labeling with Preassigned Frequencies  BranchandBound Algorithms for the Test Cover Problem  Constructing Plane Spanners of Bounded Degree and Low Weight  Eager stOrdering  ThreeDimensional Layers of Maxima  Optimal Terrain Construction Problems and Applications in IntensityModulated Radiation Therapy  Geometric Algorithms for DensityBased Data Clustering  BalancedReplication Algorithms for Distribution Trees  Butterflies and PeertoPeer Networks  Estimating Rarity and Similarity over Data Stream Windows  Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels  Frequency Estimation of Internet Packet Streams with Limited Space  Truthful and Competitive Double Auctions  Optimal Graph Exploration without Good Maps  Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee  Nonindependent Randomized Rounding and an Application to Digital Halftoning  Computing Homotopic Shortest Paths Efficiently  An Algorithm for Dualization in Products of Lattices and Its Applications  Determining Similarity of Conformational Polymorphs  Minimizing the Maximum Starting Time Online  Vector Assignment Problems: A General Framework  Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice  Simple and Fast: Improving a BranchAndBound Algorithm for Maximum Clique  Online Companion Caching  Deterministic Communication in Radio Networks with Large Labels  A Primal Approach to the Stable Set Problem  WideSense Nonblocking WDM CrossConnects  Efficient Implementation of a Minimal Triangulation Algorithm  Scheduling Malleable Parallel Tasks: An Asymptotic Fully PolynomialTime Approximation Scheme  The Probabilistic Analysis of a Greedy Satisfiability Algorithm  Dynamic Additively Weighted Voronoi Diagrams in 2D  TimeExpanded Graphs for FlowDependent Transit Times  PartiallyOrdered Knapsack and Applications to Scheduling  A Software Library for Elliptic Curve Cryptography  RealTime Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows  Randomized Approximation Algorithms for Query Optimization Problems on Two Processors  Covering Things with Things  OnLine DialaRide Problems under a Restricted Information Model  Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs  Engineering a Lightweight Suffix Array Construction Algorithm  Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations  ExternalMemory BreadthFirst Search with Sublinear I/O  Frequency Channel Assignment on Planar Networks  Design and Implementation of Efficient Data Types for Static Graphs  An Exact Algorithm for the UniformlyOriented Steiner Tree Problem  A Fast, Accurate and Simple Method for Pricing EuropeanAsian and SavingAsian Options  Sorting 13 Elements Requires 34 Comparisons  Extending Reduction Techniques for the Steiner Tree Problem  A Comparison of Multicast Pull Models  Online Scheduling for Sorting Buffers  Finding the Sink Takes Some Time  Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design  Minimizing Makespan and Preemption Costs on a System of Uniform Machines  Minimizing the Total Completion Time Online on a Single Machine, Using Restarts  HighLevel Filtering for Arrangements of Conic Arcs  An Approximation Scheme for Cake Division with a Linear Number of Cuts  A Simple Linear Time Algorithm for Finding Even Triangulations of 2Connected Bipartite Plane Graphs
 Dimensions
 unknown
 Extent
 XXVIII, 919 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540457497
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540457496
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540457497
 Label
 Algorithms — ESA 2002 : 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)
 Antecedent source
 mixed
 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
 Invited Lectures  Solving Traveling Salesman Problems  Computing Shapes from Point Cloud Data  Mechanism Design for Fun and Profit  On Distance Oracles and Routing in Graphs  Contributed Papers  Kinetic Medians and kdTrees  Range Searching in Categorical Data: Colored Range Searching on Grid  NearLinear Time Approximation Algorithms for Curve Simplification  Translating a Planar Object to Maximize Point Containment  Approximation Algorithms for kLine Center  New Heuristics and Lower Bounds for the MinMax kChinese Postman Problem  SCIL — Symbolic Constraints in Integer Linear Programming  Implementing I/Oefficient Data Structures Using TPIE  On the kSplittable Flow Problem  Partial Alphabetic Trees  Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router  Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy  Two Simplified Algorithms for Maintaining Order in a List  Efficient Tree Layout in a Multilevel Memory Hierarchy  A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons  TSP with Neighborhoods of Varying Size  1.375Approximation Algorithm for Sorting by Reversals  Radio Labeling with Preassigned Frequencies  BranchandBound Algorithms for the Test Cover Problem  Constructing Plane Spanners of Bounded Degree and Low Weight  Eager stOrdering  ThreeDimensional Layers of Maxima  Optimal Terrain Construction Problems and Applications in IntensityModulated Radiation Therapy  Geometric Algorithms for DensityBased Data Clustering  BalancedReplication Algorithms for Distribution Trees  Butterflies and PeertoPeer Networks  Estimating Rarity and Similarity over Data Stream Windows  Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels  Frequency Estimation of Internet Packet Streams with Limited Space  Truthful and Competitive Double Auctions  Optimal Graph Exploration without Good Maps  Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee  Nonindependent Randomized Rounding and an Application to Digital Halftoning  Computing Homotopic Shortest Paths Efficiently  An Algorithm for Dualization in Products of Lattices and Its Applications  Determining Similarity of Conformational Polymorphs  Minimizing the Maximum Starting Time Online  Vector Assignment Problems: A General Framework  Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice  Simple and Fast: Improving a BranchAndBound Algorithm for Maximum Clique  Online Companion Caching  Deterministic Communication in Radio Networks with Large Labels  A Primal Approach to the Stable Set Problem  WideSense Nonblocking WDM CrossConnects  Efficient Implementation of a Minimal Triangulation Algorithm  Scheduling Malleable Parallel Tasks: An Asymptotic Fully PolynomialTime Approximation Scheme  The Probabilistic Analysis of a Greedy Satisfiability Algorithm  Dynamic Additively Weighted Voronoi Diagrams in 2D  TimeExpanded Graphs for FlowDependent Transit Times  PartiallyOrdered Knapsack and Applications to Scheduling  A Software Library for Elliptic Curve Cryptography  RealTime Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows  Randomized Approximation Algorithms for Query Optimization Problems on Two Processors  Covering Things with Things  OnLine DialaRide Problems under a Restricted Information Model  Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs  Engineering a Lightweight Suffix Array Construction Algorithm  Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations  ExternalMemory BreadthFirst Search with Sublinear I/O  Frequency Channel Assignment on Planar Networks  Design and Implementation of Efficient Data Types for Static Graphs  An Exact Algorithm for the UniformlyOriented Steiner Tree Problem  A Fast, Accurate and Simple Method for Pricing EuropeanAsian and SavingAsian Options  Sorting 13 Elements Requires 34 Comparisons  Extending Reduction Techniques for the Steiner Tree Problem  A Comparison of Multicast Pull Models  Online Scheduling for Sorting Buffers  Finding the Sink Takes Some Time  Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design  Minimizing Makespan and Preemption Costs on a System of Uniform Machines  Minimizing the Total Completion Time Online on a Single Machine, Using Restarts  HighLevel Filtering for Arrangements of Conic Arcs  An Approximation Scheme for Cake Division with a Linear Number of Cuts  A Simple Linear Time Algorithm for Finding Even Triangulations of 2Connected Bipartite Plane Graphs
 Dimensions
 unknown
 Extent
 XXVIII, 919 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540457497
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540457496
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540457497
Subject
 Algorithm Analysis and Problem Complexity
 Algorithms
 Algorithms
 Algorithms
 Computational complexity
 Computational complexity
 Computer Graphics
 Computer Graphics
 Computer Science
 Computer Science
 Computer Science
 Computer graphics
 Computer graphics
 Computer science
 Computer science
 Computer science
 Computer software
 Computer software
 Computer software
 Data Structures
 Data structures (Computer science)
 Data structures (Computer science)
 Discrete Mathematics in Computer Science
 Electronic data processing
 Electronic data processing
 Electronic resources
 Numeric Computing
Member of
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

Embed (Experimental)
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.bu.edu/portal/Algorithms%E2%80%94ESA200210thAnnualEuropean/V5Jvn9oLq0/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Algorithms%E2%80%94ESA200210thAnnualEuropean/V5Jvn9oLq0/">Algorithms — ESA 2002 : 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University 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 — ESA 2002 : 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)
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.bu.edu/portal/Algorithms%E2%80%94ESA200210thAnnualEuropean/V5Jvn9oLq0/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Algorithms%E2%80%94ESA200210thAnnualEuropean/V5Jvn9oLq0/">Algorithms — ESA 2002 : 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>