Algorithm Theory - SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings

Lingua: inglese

Editore: Springer, 2002

3540438661 / 9783540438663

Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH

Venditore con 5 stelle

Venditore AbeBooks dal 14 agosto 2006

Brossura

Condizione: Nuovo

EUR 66,40

EUR 35,00 spedizione 
Spedito da Germania a U.S.A.

Quantità: 1 disponibile

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

Druck auf Anfrage Neuware - Printed after ordering - Invited Speakers.- An Efficient Quasidictionary.- Combining Pattern Discovery and Probabilistic Modeling in Data Mining.- Scheduling.- Time and Space Efficient Multi-method Dispatching.- Linear Time Approximation Schemes for Vehicle Scheduling.- Minimizing Makespan for the Lazy Bureaucrat Problem.- A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times.- Computational Geometry.- Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains.- Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D.- Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains.- Exact Algorithms and Approximation Schemes for Base Station Placement Problems.- A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels.- Optimal Algorithm for a Special Point-Labeling Problem.- Random Arc Allocation and Applications.- On Neighbors in Geometric Permutations.- Graph Algorithms.- Powers of Geometric Intersection Graphs and Dispersion Algorithms.- Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar Case.- Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.- Approximation Hardness of the Steiner Tree Problem on Graphs.- The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus.- The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms.- A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid.- Approximation Algorithms for Edge-Dilation k-Center Problems.- Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm.- Improved Algorithms for the Random Cluster Graph Model.- -List Vertex Coloring in Linear Time.- Robotics.- Robot Localization without Depth Perception.- Online Parallel Heuristics and Robot Searching under the Competitive Framework.- Analysis of Heuristics for the Freeze-Tag Problem.- Approximation Algorithms.- Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems.- All-Norm Approximation Algorithms.- Approximability of Dense Instances of Nearest Codeword Problem.- Data Communication.- Call Control with k Rejections.- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem.- Packet Bundling.- Algorithms for the Multi-constrained Routing Problem.- Computational Biology.- Computing the Threshold for q-Gram Filters.- On the Generality of Phylogenies from Incomplete Directed Characters.- Data Storage and Manipulation.- Sorting with a Forklift.- Tree Decompositions with Small Cost.- Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition.- Performance Tuning an Algorithm for Compressing Relational Tables.- A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset.- Paging on a RAM with Limited Resources.- An Optimal Algorithm for Finding NCA on Pure Pointer Machines.- Amortized Complexity of Bulk Updates in AVL-Trees.…

Codice articolo 9783540438663

Titolo
Algorithm Theory - SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings
Autore
Erik Meineche Schmidt
Editore
Springer
Anno di pubblicazione
2002
Condizione
Neu
Rilegatura
Taschenbuch
Lingua
inglese
ISBN 10
3540438661
ISBN 13
9783540438663
Peso dell'articolo
703 grammi
Dimensioni
235x155x26 mm

AHA-BUCH GmbH

Einbeck, Germania

Venditore con 5 stelle

Venditore AbeBooks dal 14 agosto 2006

Tariffe di spedizione da Germania a U.S.A.

ArticoloDa 7 a 10 giorni lavorativiDa 5 a 7 giorni lavorativi
Primo articoloEUR 35,00EUR 45,00
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay
  • Assegno
  • Bonifico bancario
  • PayPal

Descrizione dello Store

Das Unternehmen AHA-BUCH GmbH: Seit der Gründung von AHA-BUCH im Juli 2005 ist unser Hauptziel, zufriedenen Kunden so schnell und so preisgünstig wie möglich ihren Bücherwunsch zu erfüllen. Unsere Firma beschäftigt 16 Mitarbeiter, die nur ein Ziel kennen: den Kunden und seine Wünsche! Auf über 3700 m2 Fläche haben wir über 100.000 Bücher, Modernes Antiquariat und Spiele auf Lager.

Specializzazione

Kinderbücher & Kinderhör Casetten, German Books, Software, Natur & Tiere, Ratgeber, Sachbücher, Englische Bücher, Medizin & Gesundheit, Universität & Studium

Informazioni sull’azienda del venditore

AHA-BUCH GmbH

Garlebsen 48
Einbeck, Germania 37574

Imprimere

Informazioni sul venditore:

AHA-BUCH GmbH
rappresentata dall'amministratore delegato Christel Glass
Garlebsen 48
37574 Einbeck
Germania
Telefono: 055639996039
Fax: 055639995974
E-Mail: abebooks@aha-buch.de
USt-IdNr.: DE261904229
registrato presso Registro delle imprese Amtsgerichtes Göttingen
Handelsregisternummer HRB 200691

Risoluzione alternativa delle controversie:
La Commissione europea fornisce una piattaforma per la risoluzione extragiudiziale delle controversie online (piattaforma ODR), accessibile nell'ambito di https://ec.europa.eu/odr.

Siamo membri dell'iniziativa "FairCommerce" dal 25.05.2018.
Per ulteriori informazioni, vedere www.fair-commerce.de.