Algorithms - ESA 2007

Langue : anglais

Edité par Springer, Springer Sep 2007, 2007

3540755195 / 9783540755197

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagnebuchversandmimpf2000

Vendeur avec une évaluation de 5 étoiles

Vendeur AbeBooks depuis 23 janvier 2017

Livre broché

Etat: Neuf

EUR 106,99

EUR 60,00 expédition 
Expédition depuis Allemagne vers Etats-Unis

Quantité disponible : 1 disponible

Ajouter au panier
Retours gratuits sous 30 jours

A propos de cet article

This item is printed on demand - Print on Demand Titel. Neuware -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-Wo.…

N° de réf. du vendeur 9783540755197

Titre
Algorithms - ESA 2007
Auteur
Lars Arge
Éditeur
Springer, Springer Sep 2007
Année de publication
2007
État de l'article
Neu
Reliure
Taschenbuch
Langue
anglais
ISBN à 10 chiffres
3540755195
ISBN à 13 chiffres
9783540755197
Poids de l'article
1 171 grammes
Dimensions
235x155x42 mm

buchversandmimpf2000

Emtmannsberg, BAYE, Allemagne

Vendeur avec une évaluation de 5 étoiles

Vendeur AbeBooks depuis 23 janvier 2017

Frais d'expédition de Allemagne vers Etats-Unis

Article60 à 60 jours ouvrés60 à 60 jours ouvrés
Premier articleEUR 60,00EUR 75,00
Les délais de livraison sont fixés par les vendeurs et varient en fonction du transporteur et du lieu. Les commandes transitant par les douanes peuvent être retardées et les acheteurs sont responsables de tous les droits ou frais associés. Les vendeurs peuvent vous contacter au sujet de frais supplémentaires afin de couvrir toute augmentation des coûts d'expédition de vos articles.

Modes de paiement

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay
  • Chèque
  • Paypal

Description de la boutique

Impressum Thorsten Retsch Buchversand Mimpf2000 Oberölschnitz 16 95517 Emtmannsberg Deutschland Telefon: 09209-2023188 Email: mimpf2000@online.de USt-ID-Nr.: DE 235096871 Wir führen gebrauchte Bücher aus allen Sparten der Literatur

Spécialité

Modernes Antiquariat - Bücher von 1960 bis heute

Profil professionnel du vendeur

buchversandmimpf2000

Allemagne