- 5 Ergebnisse
Kleinster Preis: € 54,99, größter Preis: € 98,33, Mittelwert: € 69,01
1
Approximation and Online Algorithms (Paperback) - Bampis
Bestellen
bei AbeBooks.co.uk
£ 65,49
(ca. € 76,54)
Versand: € 0,001
Bestellengesponserter Link
Bampis:

Approximation and Online Algorithms (Paperback) - Taschenbuch

2010, ISBN: 3642124496

[EAN: 9783642124495], New book, [SC: 0.0], [PU: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin], Paperback. The 7th Workshop on Approximation and Online Algorithms (WAOA 2009… Mehr…

NEW BOOK. Versandkosten:Free shipping. (EUR 0.00) CitiRetail, Stevenage, United Kingdom [9235530] [Rating: 4 (of 5)]
2
Approximation and Online Algorithms: 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers Evripidis Bampis
Bestellen
bei BarnesandNoble.com
€ 54,99
Bestellengesponserter Link
Approximation and Online Algorithms: 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers Evripidis Bampis - neues Buch

2009, ISBN: 9783642124495

This book constitutes the thoroughly refereed post workshop proceedings of the 7th International Workshop on Approximation and Online Algorithms, WAOA 2009, held in Copenhagen, Denmark, i… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
3
Approximation and Online Algorithms: 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers (Lecture Notes in Computer Science, 5893, Band 5893)
Bestellen
bei amazon.de
€ 98,33
Versand: € 3,001
Bestellengesponserter Link
Approximation and Online Algorithms: 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers (Lecture Notes in Computer Science, 5893, Band 5893) - Taschenbuch

2010

ISBN: 9783642124495

Springer, Taschenbuch, Auflage: 2010, 265 Seiten, Publiziert: 2010-04-23T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: 23 black & white illustrations, biograph, 0.88 kg, Informatik, IT-… Mehr…

Versandkosten:Auf Lager. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) ausverkauf
4
Bestellen
bei ZVAB.com
£ 47,99
(ca. € 56,09)
Versand: € 7,641
Bestellengesponserter Link
Bampis, Evripidis und Klaus Jansen:
Approximation and Online Algorithms 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers - Taschenbuch

2010, ISBN: 3642124496

[EAN: 9783642124495], Used, good, [SC: 7.64], [PU: Springer Berlin], ALGORITHMIC GRAPH THEORY,ALGORITHM DESIGN,APPROXIMATION,SCHEDULING,COMPLEXITY,ALGORITHMIC GAME THEORY,PARTITION,ALGORI… Mehr…

NOT NEW BOOK. Versandkosten: EUR 7.64 Buchpark, Trebbin, Germany [83435977] [Rating: 5 (of 5)]
5
Approximation and Online Algorithms 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers - Bampis, Evripidis und Klaus Jansen
Bestellen
bei booklooker.de
€ 59,10
Versand: € 0,001
Bestellengesponserter Link
Bampis, Evripidis und Klaus Jansen:
Approximation and Online Algorithms 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers - gebrauchtes Buch

2010, ISBN: 9783642124495

[PU: Springer Berlin], Neubindung, Buchecken und -kanten leicht angestoßen, Cover leicht zerkratzt 6960637/12, DE, [SC: 0.00], gebraucht; sehr gut, gewerbliches Angebot, 2010, Banküberwei… Mehr…

Versandkosten:Versandkostenfrei. (EUR 0.00) Buchpark GmbH

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch
Approximation and Online Algorithms: 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers Evripidis Bampis

This book constitutes the thoroughly refereed post workshop proceedings of the 7th International Workshop on Approximation and Online Algorithms, WAOA 2009, held in Copenhagen, Denmark, in September 2009 as part of the ALGO 2009 conference event. The 22 revised full papers presented were carefully reviewed and selected from 62 submissions. The workshop covered areas such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques, real-world applications, and scheduling problems.

Detailangaben zum Buch - Approximation and Online Algorithms: 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers Evripidis Bampis


EAN (ISBN-13): 9783642124495
ISBN (ISBN-10): 3642124496
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2010
Herausgeber: Springer Berlin Heidelberg Core >1 >T
254 Seiten
Gewicht: 0,412 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2009-11-18T01:44:34+01:00 (Zurich)
Detailseite zuletzt geändert am 2024-04-05T11:40:30+02:00 (Zurich)
ISBN/EAN: 9783642124495

ISBN - alternative Schreibweisen:
3-642-12449-6, 978-3-642-12449-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: jansen klaus, jan jansen, evripidis, evripid, voronkov
Titel des Buches: copenhagen, algorithms approximation theoretical, denmark, online


Daten vom Verlag:

Autor/in: Evripidis Bampis; Klaus Jansen
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Approximation and Online Algorithms - 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers
Verlag: Springer; Springer Berlin
255 Seiten
Erscheinungsjahr: 2010-04-23
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
X, 255 p. 23 illus.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Computerprogrammierung und Softwareentwicklung; Verstehen; Partition; algorithm analysis; algorithm design; algorithmic game theory; algorithmic graph theory; algorithmics; algorithms; approximation; complexity; scheduling; algorithm analysis and problem complexity; Programming Techniques; Theory of Computation; Computer and Information Systems Applications; Algorithms; Discrete Mathematics in Computer Science; Numerical Analysis; Theoretische Informatik; Angewandte Informatik; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Numerische Mathematik; EA

WAOA 2009.- On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems.- Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications.- Price Fluctuations: To Buy or to Rent.- Approximation Algorithms for Multiple Strip Packing.- Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window.- Longest Wait First for Broadcast Scheduling [Extended Abstract].- The Routing Open Shop Problem: New Approximation Algorithms.- On the Price of Stability for Undirected Network Design.- Finding Dense Subgraphs in G(n,1/2).- Parameterized Analysis of Paging and List Update Algorithms.- Online Scheduling of Bounded Length Jobs to Maximize Throughput.- On the Additive Constant of the k-Server Work Function Algorithm.- A (4?+??)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs.- Guard Games on Graphs: Keep the Intruder Out!.- Between a Rock and a Hard Place: The Two-to-One Assignment Problem.- Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width.- Online Minimization Knapsack Problem.- Optimization Problems in Multiple Subtree Graphs.- Multi-Criteria TSP: Min and Max Combined.- Packet Routing: Complexity and Algorithms.- Minimal Cost Reconfiguration of Data Placement in Storage Area Network.- Competitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin Packing.
Up-to-date results Fast track conference proceeding State-of-the-art report

< zum Archiv...