Algorithms - ESA 2007

15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings

Häftad, Engelska, 2007

Av Lars Arge, Michael Hoffmann, Emo Welzl

1 409 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed proceedings of the 15th Annual European Symposium on Algorithms, ESA 2007, held in Eilat, Israel, in October 2007 in the context of the combined conference ALGO 2007. The 63 revised full papers presented together with abstracts of three invited lectures address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields.

Produktinformation

Utgivningsdatum2007-09-20
Mått155 x 235 x 42 mm
Vikt1 171 g
SpråkEngelska
SerieTheoretical Computer Science and General Issues
Antal sidor772
Upplaga2007
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
EAN9783540755197

Du kanske också är intresserad av

Algorithm Theory - SWAT 2006

Lars Arge, Rusins Freivalds

709 kr

Del 52

Combinatorial and Computational Geometry

Jacob E. Goodman, Janos Pach, Emo Welzl, City University of New York) Goodman, Jacob E. (City College, City University of New York and New York University) Pach, Janos (City College, Emo (Eidgenossische Technische Hochschule Zurich) Welzl

969 kr

Del 1853

Automata, Languages and Programming

Ugo Montanari, Jose D.P. Rolim, Emo Welzl, Jose D. P. Rolim

1 449 kr

Del 52

Combinatorial and Computational Geometry

1 719 kr

Automata, Languages and Programming

Lars Arge, Christian Cachin, Tomasz Jurdzinski

1 449 kr

Cognitive, Conative and Behavioral Neurology

Michael Hoffmann

1 449 kr

Kälteanlagentechnik

Dietmar Schittenhelm, Michael Hoffmann

889 kr

Del 81

Entstehung von Ordnung

Michael Hoffmann

2 249 kr

Världens 100 underverk

Michael Hoffmann, Alexander Kings

139 kr

Tillhör följande kategorier

Programmeringsböcker inom Data och it
Diskret matematik inom Naturvetenskap och teknik
Beräkning och matematisk analys inom Naturvetenskap och teknik
Hårdvara inom Data och it
Programvaruutveckling inom Data och it
Databaser inom Data och it
Systemvetenskap och AI inom Data och it

Invited Lectures.- Nash Equilibria: Where We Stand.- Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation.- Arrangements in Geometry: Recent Advances and Challenges.- Contributed Papers: Design and Analysis Track.- Nash Equilibria in Voronoi Games on Graphs.- Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation.- Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks.- Finding Frequent Elements in Non-bursty Streams.- Tradeoffs and Average-Case Equilibria in Selfish Routing.- On the Variance of Subset Sum Estimation.- On Minimum Power Connectivity Problems.- On the Cost of Interchange Rearrangement in Strings.- Finding Mobile Data: Efficiency vs. Location Inaccuracy.- A Faster Query Algorithm for the Text Fingerprinting Problem.- Polynomial Time Algorithms for Minimum Energy Scheduling.- k-Mismatch with Don’t Cares.- Finding Branch-Decompositions and Rank-Decompositions.- Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover.- Linear-Time Ranking of Permutations.- Radix Sorting with No Extra Space.- Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation.- Order Statistics in the Farey Sequences in Sublinear Time.- New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks.- Dial a Ride from k-Forest.- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue.- Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication.- Optimal Algorithms for k-Search with Application in Option Pricing.- Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra.- Stackelberg Strategies for Atomic Congestion Games.- Good Quality VirtualRealization of Unit Ball Graphs.- Algorithms for Playing Games with Limited Randomness.- Approximation of Partial Capacitated Vertex Cover.- Optimal Resilient Dynamic Dictionaries.- Determining the Smallest k Such That G Is k-Outerplanar.- On the Size of Succinct Indices.- Compact Oracles for Approximate Distances Around Obstacles in the Plane.- Convex Combinations of Single Source Unsplittable Flows.- Farthest-Polygon Voronoi Diagrams.- Equitable Revisited.- Online Scheduling of Equal-Length Jobs on Parallel Machines.- k-Anonymization with Minimal Loss of Information.- A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs.- Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling.- Bundle Pricing with Comparable Items.- Approximating Interval Scheduling Problems with Bounded Profits.- Pricing Tree Access Networks with Connected Backbones.- Distance Coloring.- An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching.- To Fill or Not to Fill: The Gas Station Problem.- Online Bandwidth Allocation.- Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems.- On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems.- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs.- Dynamic Plane Transitive Closure.- Contributed Papers: Engineering and Applications Track.- Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments.- Estimating Clustering Indexes in Data Streams.- Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics.- Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step.- Fast and Compact Oracles for Approximate Distances in Planar Graphs.- Exact Minkowksi Sumsof Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces.- A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks.- Algorithms to Separate -Chvátal-Gomory Cuts.- Fast Lowest Common Ancestor Computations in Dags.- A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem.- Solutions to Real-World Instances of PSPACE-Complete Stacking.- Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough.- An Experimental Study of New and Known Online Packet Buffering Algorithms.

Algorithms - ESA 2007

15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings

Produktinformation

Du kanske också är intresserad av

Algorithm Theory - SWAT 2006

Combinatorial and Computational Geometry

Automata, Languages and Programming

Combinatorial and Computational Geometry

Automata, Languages and Programming

Cognitive, Conative and Behavioral Neurology

Kälteanlagentechnik

Entstehung von Ordnung

Världens 100 underverk

Geschichte 7/8. Schulbuch. Differenzierende Ausgabe für Realschulen und Gemeinschaftsschulen. Baden-Württemberg

Tillhör följande kategorier

Innehållsförteckning

Akademibokhandeln

Akademibokhandeln

Hjälp

Hjälp

Tjänster

Tjänster

Erbjudanden

Erbjudanden

Inspiration

Inspiration