- 5 Resultados
precio mínimo: € 47,37, precio máximo: € 73,59, precio promedio: € 62,04
1
Algorithms - ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings (Lecture Notes in Computer Science, 6346, Band 6346)
Pedir
por amazon.de
€ 47,37
Envío: € 3,001
PedirEnlace patrocinado

Algorithms - ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings (Lecture Notes in Computer Science, 6346, Band 6346) - Pasta blanda

2010, ISBN: 9783642157745

Springer, Taschenbuch, Auflage: 2010, 605 Seiten, Publiziert: 2010-08-30T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: Illustrations, 2 kg, Grafik & Multimedia, Computer & Internet, Kat… Más…

Gastos de envío:Auf Lager. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) ausverkauf
2
Algorithms - ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings Mark de Berg Editor
Pedir
por BarnesandNoble.com
€ 54,99
PedirEnlace patrocinado
Algorithms - ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings Mark de Berg Editor - libro nuevo

2010, ISBN: 9783642157745

This book constitutes the proceedings of the 18th Annual European Symposium on Algorithms, held in Liverpool, UK in September 2010. Trade Books>Trade Paperback>Technology>Xxxsoftware Engr… Más…

new in stock. Gastos de envío:zzgl. Versandkosten., más gastos de envío
3
Pedir
por Biblio.co.uk
$ 80,12
(aprox. € 73,20)
Envío: € 11,901
PedirEnlace patrocinado
De Berg, Mark (Editor):
Algorithms -- Esa 2010: 18th Annual European Symposium, Liverpool, Uk, September 6-8, 2010, Proceedings - Pasta blanda

2010

ISBN: 9783642157745

Springer-Verlag New York Inc, 2010. Paperback. New. 1st edition. 605 pages. 9.20x6.10x1.30 inches., Springer-Verlag New York Inc, 2010, 6

Gastos de envío: EUR 11.90 Revaluation Books
4
Pedir
por AbeBooks.de
€ 73,59
Envío: € 11,621
PedirEnlace patrocinado
De Berg, Mark (Editor):
Algorithms -- Esa 2010: 18th Annual European Symposium, Liverpool, Uk, September 6-8, 2010, Proceedings - Primera edición

2010, ISBN: 3642157742

Pasta blanda

[EAN: 9783642157745], Neubuch, [PU: Springer-Verlag New York Inc], 1st edition. 605 pages. 9.20x6.10x1.30 inches. In Stock., Books

NEW BOOK. Gastos de envío: EUR 11.62 Revaluation Books, Exeter, United Kingdom [2134736] [Rating: 5 (von 5)]
5
Algorithms - ESA 2010 Theoretical Computer Science and General Issues - Mark de Berg (editor), Ulrich Meyer (editor)
Pedir
por Blackwells.co.uk
£ 52,63
(aprox. € 61,06)
Envío: € 7,541
PedirEnlace patrocinado
Mark de Berg (editor), Ulrich Meyer (editor):
Algorithms - ESA 2010 Theoretical Computer Science and General Issues - Pasta blanda

2010, ISBN: 9783642157745

paperback, [PU: Springer, Berlin/Heidelberg/New York, NY]

in stock. Gastos de envío:Usually dispatched within 7 days. (EUR 7.54) Blackwells.co.uk

1Dado que algunas plataformas no nos comunican las condiciones de envío y éstas pueden depender del país de entrega, del precio de compra, del peso y tamaño del artículo, de una posible membresía a la plataforma, de una entrega directa por parte de la plataforma o a través de un tercero (Marketplace), etc., es posible que los gastos de envío indicados por eurolibro/terralibro no concuerden con los de la plataforma ofertante.

Datos bibliográficos del mejor libro coincidente

Detalles del libro
Algorithms - ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings Mark de Berg Editor

This book constitutes the proceedings of the 18th Annual European Symposium on Algorithms, held in Liverpool, UK in September 2010.

Detalles del libro - Algorithms - ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings Mark de Berg Editor


EAN (ISBN-13): 9783642157745
ISBN (ISBN-10): 3642157742
Tapa dura
Tapa blanda
Año de publicación: 2010
Editorial: Springer Berlin Heidelberg Core >1
587 Páginas
Peso: 0,899 kg
Idioma: eng/Englisch

Libro en la base de datos desde 2007-03-02T10:33:10-06:00 (Mexico City)
Página de detalles modificada por última vez el 2024-03-13T02:03:21-06:00 (Mexico City)
ISBN/EAN: 9783642157745

ISBN - escritura alterna:
3-642-15774-2, 978-3-642-15774-5
Mode alterno de escritura y términos de búsqueda relacionados:
Autor del libro: ulrich meyer, berg von
Título del libro: liverpool, september, esa, european symposium, algorithms, lecture notes computer science, berg 1094 1994


Datos del la editorial

Autor: Mark de Berg; Ulrich Meyer
Título: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Algorithms - ESA 2010 - 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings
Editorial: Springer; Springer Berlin
587 Páginas
Año de publicación: 2010-08-30
Berlin; Heidelberg; DE
Peso: 0,907 kg
Idioma: Inglés
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
POD
XVIII, 587 p. 68 illus.

BC; Software Engineering/Programming and Operating Systems; Hardcover, Softcover / Informatik, EDV/Informatik; Software Engineering; Verstehen; CSP; Huffman; Partition; Permutation; Routing; Scheduling; algorithmic aspects; algorithms; complexity; data structures; graph algorithms; planar graphs; real-time scheduling; sorting; algorithm analysis and problem complexity; Algorithm Analysis and Problem Complexity; Computer Communication Networks; Discrete Mathematics in Computer Science; Computer Graphics; Numeric Computing; Software Engineering; Algorithms; Computer Communication Networks; Discrete Mathematics in Computer Science; Computer Graphics; Numerical Analysis; Algorithmen und Datenstrukturen; Netzwerk-Hardware; Mathematik für Informatiker; Diskrete Mathematik; Grafikprogrammierung; Numerische Mathematik; EA

Invited Talk.- The Robustness of Level Sets.- Session 1a.- Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods.- Non-clairvoyant Speed Scaling for Weighted Flow Time.- A Robust PTAS for Machine Covering and Packing.- Session 1b.- Balancing Degree, Diameter and Weight in Euclidean Spanners.- Testing Euclidean Spanners.- Fast Approximation in Subspaces by Doubling Metric Decomposition.- f-Sensitivity Distance Oracles and Routing Schemes.- Session 2a.- Fast Minor Testing in Planar Graphs.- On the Number of Spanning Trees a Planar Graph Can Have.- Contractions of Planar Graphs in Polynomial Time.- Session 2b.- Communication Complexity of Quasirandom Rumor Spreading.- A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing.- Contribution Games in Social Networks.- Session 3a.- Improved Bounds for Online Stochastic Matching.- Online Stochastic Packing Applied to Display Ad Allocation.- Caching Is Hard – Even in the Fault Model.- Session 3b.- Superselectors: Efficient Constructions and Applications.- Estimating the Average of a Lipschitz-Continuous Function from One Sample.- Streaming Graph Computations with a Helpful Advisor.- Session 4a.- Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier.- Minimum Vertex Cover in Rectangle Graphs.- Feedback Vertex Sets in Tournaments.- Session 4b.- n-Level Graph Partitioning.- Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns.- Finding the Diameter in Real-World Graphs.- Session 5a.- Budgeted Red-Blue Median and Its Generalizations.- All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables.- Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems.- Robust Algorithms for Sorting Railway Cars.- Session 5b.- Cloning Voronoi Diagrams via Retroactive Data Structures.- A Unified Approach to Approximate Proximity Searching.- Spatio-temporal Range Searching over Compressed Kinetic Sensor Data.- Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space.- Invited Talk.- Local Graph Exploration and Fast Property Testing.- Session 6a.- A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings.- Fast Prefix Search in Little Space, with Applications.- On the Huffman and Alphabetic Tree Problem with General Cost Functions.- Medium-Space Algorithms for Inverse BWT.- Session 6b.- Median Trajectories.- Optimal Cover of Points by Disks in a Simple Polygon.- Stability of ?-Kernels.- The Geodesic Diameter of Polygonal Domains.- Session 7a.- Polyhedral and Algorithmic Properties of Quantified Linear Programs.- Approximating Parameterized Convex Optimization Problems.- Approximation Schemes for Multi-Budgeted Independence Systems.- Session 7b.- Algorithmic Meta-theorems for Restrictions of Treewidth.- Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus.- Constructing the R* Consensus Tree of Two Trees in Subcubic Time.

< para archivar...