Algorithms ESA 2004 : 12th annual European symposium, Bergen, Norway, September 14 17, 2004 : proceedings
User Rating: Be the first one!
Author: ESA (Symposium) (12th : 2004 : Bergen, Norway), Albers, Susanne, Radzik, Tomasz
Added by: sketch
Added Date: 2015-12-29
Language: eng
Subjects: Computer algorithms, Algorithmes, Algoritmos e estruturas de dados (congressos), Algorithme, Algorithme
Publishers: Berlin ; New York : Springer
Collections: journals contributions, journals
ISBN Number: 3540230254, 9783540230250
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 407.38 MB
PDF Size: 7.71 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 1.08K
Views: 51.08
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 b100428 archive torrent
Last Modified: 2023-05-26 03:16:16
Download
Size: 19.89 KB
Description
Algorithms – ESA 2004: 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings
Author: Susanne Albers, Tomasz Radzik
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-23025-0
DOI: 10.1007/b100428
Table of Contents:
"12th Annual European Symposium on Algorithms (ESA 2004)"--Preface
Includes bibliographical references and index
Invited lectures -- Design and analysis track -- Engineering and applications track -- Author index
Author: Susanne Albers, Tomasz Radzik
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-23025-0
DOI: 10.1007/b100428
Table of Contents:
- A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing
- Algorithmic Aspects of Web Search Engines
- 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
"12th Annual European Symposium on Algorithms (ESA 2004)"--Preface
Includes bibliographical references and index
Invited lectures -- Design and analysis track -- Engineering and applications track -- Author index
You May Also Like
We will be happy to hear your thoughts