The Resource Algorithms ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings
Algorithms ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings
Resource Information
The item Algorithms ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings 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 1 library branch.
Resource Information
The item Algorithms ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings 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 1 library branch.
- Summary
- This book constitutes the refereed proceedings of the 12th Annual European Symposium on Algorithms, ESA 2004, held in Bergen, Norway, in September 2004. The 70 revised full papers presented were carefully reviewed from 208 submissions. The scope of the papers spans the entire range of algorithmics from design and mathematical issues to real-world applications in various fields, and engineering and analysis of algorithms
- Language
- eng
- Extent
- 1 online resource.
- Contents
-
- Invited Lectures
- A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing
- Algorithmic Aspects of Web Search Engines
- Design and Analysis Track
- Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects
- Swap and Mismatch Edit Distance
- Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
- Optimal External Memory Planar Point Enclosure
- Maximizing Throughput in Multi-queue Switches
- An Improved Algorithm for CIOQ Switches
- Labeling Smart Dust
- Graph Decomposition Lemmas and Their Role in Metric Embedding Methods
- Modeling Locality: A Probabilistic Analysis of LRU and FWF
- An Algorithm for Computing DNA Walks
- Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
- Direct Routing: Algorithms and Complexity
- Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families
- A Parameterized Algorithm for Upward Planarity Testing
- Fisher Equilibrium Price with a Class of Concave Utility Functions
- Hardness and Approximation Results for Packing Steiner Trees
- Approximation Hardness of Dominating Set Problems
- Improved Online Algorithms for Buffer Management in QoS Switches
- Time Dependent Multi Scheduling of Multicast
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- The Average Case Analysis of Partition Sorts
- A Fast Distributed Algorithm for Approximating the Maximum Matching
- Extreme Points Under Random Noise
- Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings
- On Variable-Sized Multidimensional Packing
- An Inductive Construction for Plane Laman Graphs via Vertex Splitting
- Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
- On the Evolution of Selfish Routing
- Competitive Online Approximation of the Optimal Search Ratio
- Incremental Algorithms for Facility Location and k-Median
- Dynamic Shannon Coding
- Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries
- Negotiation-Range Mechanisms: Coalition-Resistant Markets
- Approximation Algorithms for Quickest Spanning Tree Problems
- An Approximation Algorithm for Maximum Triangle Packing
- Approximate Parameterized Matching
- Approximation of Rectangle Stabbing and Interval Stabbing Problems
- Fast 3-Coloring Triangle-Free Planar Graphs
- Approximate Unions of Lines and Minkowski Sums
- Radio Network Clustering from Scratch
- Seeking a Vertex of the Planar Matching Polytope in NC
- Equivalence of Search Capability Among Mobile Guards with Various Visibilities
- Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous Processors
- On the Stability of Multiple Partner Stable Marriages with Ties
- Flows on Few Paths: Algorithms and Lower Bounds
- Maximum Matchings in Planar Graphs via Gaussian Elimination
- Fast Multipoint Evaluation of Bivariate Polynomials
- On Adaptive Integer Sorting
- Tiling a Polygon with Two Kinds of Rectangles
- On Dynamic Shortest Paths Problems
- Uniform Algorithms for Deterministic Construction of Efficient Dictionaries
- Fast Sparse Matrix Multiplication
- Engineering and Applications Track
- An Experimental Study of Random Knapsack Problems
- Contraction and Treewidth Lower Bounds
- Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks
- Comparing Real Algebraic Numbers of Small Degree
- Code Flexibility and Program Efficiency by Genericity: Improving Cgal 's Arrangements
- Finding Dominators in Practice
- Data Migration on Parallel Disks
- Classroom Examples of Robustness Problems in Geometric Computations
- Stable Minimum Storage Merging by Symmetric Comparisons
- On Rectangular Cartograms
- Multi-word Atomic Read/Write Registers on Multiprocessor Systems
- Beyond Optimal Play in Two-Person-Zerosum Games
- Solving Geometric Covering Problems by Data Reduction
- Efficient IP Table Lookup via Adaptive Stratified Trees with Selective Reconstructions
- Super Scalar Sample Sort
- Construction of Minimum-Weight Spanners
- A Straight Skeleton Approximating the Medial Axis
- Non-additive Shortest Paths
- Isbn
- 9783540301400
- Label
- Algorithms ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings
- Title
- Algorithms ESA 2004
- Title remainder
- 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings
- Subject
-
- Computational complexity
- Computational complexity
- Computer graphics
- Computer graphics
- Computer science
- Computer science
- Computer software
- Computer software
- Data structures (Computer science)
- Data structures (Computer science)
- Discrete Mathematics
- Electronic data processing
- Electronic data processing
- Numeric Computing
- Algorithm Analysis and Problem Complexity
- Language
- eng
- Summary
- This book constitutes the refereed proceedings of the 12th Annual European Symposium on Algorithms, ESA 2004, held in Bergen, Norway, in September 2004. The 70 revised full papers presented were carefully reviewed from 208 submissions. The scope of the papers spans the entire range of algorithmics from design and mathematical issues to real-world applications in various fields, and engineering and analysis of algorithms
- Cataloging source
- DKDLA
- http://library.link/vocab/creatorName
- Albers, Susanne
- Dewey number
- 005.1
- Index
- no index present
- LC call number
- QA76.9.A43
- Literary form
- non fiction
- Nature of contents
-
- dictionaries
- standards specifications
- http://library.link/vocab/relatedWorkOrContributorName
- Radzik, Tomasz
- Series statement
- Lecture Notes in Computer Science
- Series volume
- 3221,
- http://library.link/vocab/subjectName
-
- Computer science
- Data structures (Computer science)
- Computer software
- Electronic data processing
- Computational complexity
- Computer graphics
- Algorithm Analysis and Problem Complexity
- Numeric Computing
- Discrete Mathematics
- Computational complexity
- Computer graphics
- Computer science
- Computer software
- Data structures (Computer science)
- Electronic data processing
- Label
- Algorithms ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- Invited Lectures -- A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing -- Algorithmic Aspects of Web Search Engines -- Design and Analysis Track -- Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects -- Swap and Mismatch Edit Distance -- Path Decomposition Under a New Cost Measure with Applications to Optical Network Design -- Optimal External Memory Planar Point Enclosure -- Maximizing Throughput in Multi-queue Switches -- An Improved Algorithm for CIOQ Switches -- Labeling Smart Dust -- Graph Decomposition Lemmas and Their Role in Metric Embedding Methods -- Modeling Locality: A Probabilistic Analysis of LRU and FWF -- An Algorithm for Computing DNA Walks -- Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems -- Direct Routing: Algorithms and Complexity -- Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families -- A Parameterized Algorithm for Upward Planarity Testing -- Fisher Equilibrium Price with a Class of Concave Utility Functions -- Hardness and Approximation Results for Packing Steiner Trees -- Approximation Hardness of Dominating Set Problems -- Improved Online Algorithms for Buffer Management in QoS Switches -- Time Dependent Multi Scheduling of Multicast -- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems -- The Average Case Analysis of Partition Sorts -- A Fast Distributed Algorithm for Approximating the Maximum Matching -- Extreme Points Under Random Noise -- Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings -- On Variable-Sized Multidimensional Packing -- An Inductive Construction for Plane Laman Graphs via Vertex Splitting -- Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems -- On the Evolution of Selfish Routing -- Competitive Online Approximation of the Optimal Search Ratio -- Incremental Algorithms for Facility Location and k-Median -- Dynamic Shannon Coding -- Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries -- Negotiation-Range Mechanisms: Coalition-Resistant Markets -- Approximation Algorithms for Quickest Spanning Tree Problems -- An Approximation Algorithm for Maximum Triangle Packing -- Approximate Parameterized Matching -- Approximation of Rectangle Stabbing and Interval Stabbing Problems -- Fast 3-Coloring Triangle-Free Planar Graphs -- Approximate Unions of Lines and Minkowski Sums -- Radio Network Clustering from Scratch -- Seeking a Vertex of the Planar Matching Polytope in NC -- Equivalence of Search Capability Among Mobile Guards with Various Visibilities -- Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous Processors -- On the Stability of Multiple Partner Stable Marriages with Ties -- Flows on Few Paths: Algorithms and Lower Bounds -- Maximum Matchings in Planar Graphs via Gaussian Elimination -- Fast Multipoint Evaluation of Bivariate Polynomials -- On Adaptive Integer Sorting -- Tiling a Polygon with Two Kinds of Rectangles -- On Dynamic Shortest Paths Problems -- Uniform Algorithms for Deterministic Construction of Efficient Dictionaries -- Fast Sparse Matrix Multiplication -- Engineering and Applications Track -- An Experimental Study of Random Knapsack Problems -- Contraction and Treewidth Lower Bounds -- Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks -- Comparing Real Algebraic Numbers of Small Degree -- Code Flexibility and Program Efficiency by Genericity: Improving Cgal 's Arrangements -- Finding Dominators in Practice -- Data Migration on Parallel Disks -- Classroom Examples of Robustness Problems in Geometric Computations -- Stable Minimum Storage Merging by Symmetric Comparisons -- On Rectangular Cartograms -- Multi-word Atomic Read/Write Registers on Multiprocessor Systems -- Beyond Optimal Play in Two-Person-Zerosum Games -- Solving Geometric Covering Problems by Data Reduction -- Efficient IP Table Lookup via Adaptive Stratified Trees with Selective Reconstructions -- Super Scalar Sample Sort -- Construction of Minimum-Weight Spanners -- A Straight Skeleton Approximating the Medial Axis -- Non-additive Shortest Paths
- Control code
- 769770652
- Extent
- 1 online resource.
- Form of item
- online
- Isbn
- 9783540301400
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Specific material designation
- remote
- System control number
- (OCoLC)769770652
- Label
- Algorithms ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- Invited Lectures -- A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing -- Algorithmic Aspects of Web Search Engines -- Design and Analysis Track -- Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects -- Swap and Mismatch Edit Distance -- Path Decomposition Under a New Cost Measure with Applications to Optical Network Design -- Optimal External Memory Planar Point Enclosure -- Maximizing Throughput in Multi-queue Switches -- An Improved Algorithm for CIOQ Switches -- Labeling Smart Dust -- Graph Decomposition Lemmas and Their Role in Metric Embedding Methods -- Modeling Locality: A Probabilistic Analysis of LRU and FWF -- An Algorithm for Computing DNA Walks -- Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems -- Direct Routing: Algorithms and Complexity -- Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families -- A Parameterized Algorithm for Upward Planarity Testing -- Fisher Equilibrium Price with a Class of Concave Utility Functions -- Hardness and Approximation Results for Packing Steiner Trees -- Approximation Hardness of Dominating Set Problems -- Improved Online Algorithms for Buffer Management in QoS Switches -- Time Dependent Multi Scheduling of Multicast -- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems -- The Average Case Analysis of Partition Sorts -- A Fast Distributed Algorithm for Approximating the Maximum Matching -- Extreme Points Under Random Noise -- Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings -- On Variable-Sized Multidimensional Packing -- An Inductive Construction for Plane Laman Graphs via Vertex Splitting -- Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems -- On the Evolution of Selfish Routing -- Competitive Online Approximation of the Optimal Search Ratio -- Incremental Algorithms for Facility Location and k-Median -- Dynamic Shannon Coding -- Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries -- Negotiation-Range Mechanisms: Coalition-Resistant Markets -- Approximation Algorithms for Quickest Spanning Tree Problems -- An Approximation Algorithm for Maximum Triangle Packing -- Approximate Parameterized Matching -- Approximation of Rectangle Stabbing and Interval Stabbing Problems -- Fast 3-Coloring Triangle-Free Planar Graphs -- Approximate Unions of Lines and Minkowski Sums -- Radio Network Clustering from Scratch -- Seeking a Vertex of the Planar Matching Polytope in NC -- Equivalence of Search Capability Among Mobile Guards with Various Visibilities -- Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous Processors -- On the Stability of Multiple Partner Stable Marriages with Ties -- Flows on Few Paths: Algorithms and Lower Bounds -- Maximum Matchings in Planar Graphs via Gaussian Elimination -- Fast Multipoint Evaluation of Bivariate Polynomials -- On Adaptive Integer Sorting -- Tiling a Polygon with Two Kinds of Rectangles -- On Dynamic Shortest Paths Problems -- Uniform Algorithms for Deterministic Construction of Efficient Dictionaries -- Fast Sparse Matrix Multiplication -- Engineering and Applications Track -- An Experimental Study of Random Knapsack Problems -- Contraction and Treewidth Lower Bounds -- Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks -- Comparing Real Algebraic Numbers of Small Degree -- Code Flexibility and Program Efficiency by Genericity: Improving Cgal 's Arrangements -- Finding Dominators in Practice -- Data Migration on Parallel Disks -- Classroom Examples of Robustness Problems in Geometric Computations -- Stable Minimum Storage Merging by Symmetric Comparisons -- On Rectangular Cartograms -- Multi-word Atomic Read/Write Registers on Multiprocessor Systems -- Beyond Optimal Play in Two-Person-Zerosum Games -- Solving Geometric Covering Problems by Data Reduction -- Efficient IP Table Lookup via Adaptive Stratified Trees with Selective Reconstructions -- Super Scalar Sample Sort -- Construction of Minimum-Weight Spanners -- A Straight Skeleton Approximating the Medial Axis -- Non-additive Shortest Paths
- Control code
- 769770652
- Extent
- 1 online resource.
- Form of item
- online
- Isbn
- 9783540301400
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Specific material designation
- remote
- System control number
- (OCoLC)769770652
Subject
- Computational complexity
- Computational complexity
- Computer graphics
- Computer graphics
- Computer science
- Computer science
- Computer software
- Computer software
- Data structures (Computer science)
- Data structures (Computer science)
- Discrete Mathematics
- Electronic data processing
- Electronic data processing
- Numeric Computing
- Algorithm Analysis and Problem Complexity
Member of
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 fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Algorithms-ESA-2004--12th-Annual-European/O9aEKFGuo8Y/" 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/Algorithms-ESA-2004--12th-Annual-European/O9aEKFGuo8Y/">Algorithms ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings</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 ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Algorithms-ESA-2004--12th-Annual-European/O9aEKFGuo8Y/" 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/Algorithms-ESA-2004--12th-Annual-European/O9aEKFGuo8Y/">Algorithms ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings</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>
