- 5 Ergebnisse
Kleinster Preis: € 85,59, größter Preis: € 107,31, Mittelwert: € 98,10
1
Bestellen
bei Indigo.ca
C$ 142,95
(ca. € 101,93)
Bestellengesponserter Link

Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Pa - neues Buch

2010, ISBN: 9783642175138

This volume contains the proceedings of the 21st Annual International S- posium on Algorithms and Computations (ISAAC 2010), held in Jeju, Korea during December 15-17, 2010. Past … Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
2
Algorithms and Computation by Otfried Cheong Paperback | Indigo Chapters
Bestellen
bei Indigo.ca
C$ 151,95
(ca. € 107,31)
Bestellengesponserter Link
Algorithms and Computation by Otfried Cheong Paperback | Indigo Chapters - neues Buch

2010, ISBN: 9783642175138

This volume contains the proceedings of the 21st Annual International S- posium on Algorithms and Computations (ISAAC 2010), held in Jeju, Korea during December 15-17, 2010. Past editions… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
3
Bestellen
bei buchfreund.de
€ 94,11
Versand: € 0,001
Bestellengesponserter Link
Cheong, Otfried, Kyung-Yong Chwa und Kunsoo Park:
Algorithms and Computation 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II 2010 - gebrauchtes Buch

2010

ISBN: 9783642175138

2010 Gepflegter, sauberer Zustand. 9888467/2 Versandkostenfreie Lieferung data structure,combinatorial optimization,AAC,computational geometry,complexity,algorithm analysis and problem co… Mehr…

Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Buchpark GmbH, 14959 Trebbin
4
Algorithms and Computation 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II - Cheong, Otfried, Kyung-Yong Chwa  und Kunsoo Park
Bestellen
bei booklooker.de
€ 101,57
Versand: € 0,001
Bestellengesponserter Link
Cheong, Otfried, Kyung-Yong Chwa und Kunsoo Park:
Algorithms and Computation 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II - gebrauchtes Buch

2010, ISBN: 9783642175138

[PU: Springer Berlin], Gepflegter, sauberer Zustand. 9888467/2, DE, [SC: 0.00], gebraucht; sehr gut, gewerbliches Angebot, 2010, Banküberweisung, PayPal, Klarna-Sofortüberweisung, Interna… Mehr…

Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Buchpark GmbH
5
Bestellen
bei lehmanns.de
€ 85,59
Versand: € 9,951
Bestellengesponserter Link
Otfried Cheong; Kyung-Yong Chwa; Kunsoo Park:
Algorithms and Computation - Taschenbuch

2010, ISBN: 9783642175138

21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 2010

Versandkosten:Lieferbar (Termin unbekannt) (EUR 9.95)

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
Algorithms and Computation by Otfried Cheong Paperback | Indigo Chapters

This book constitutes the refereed proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC 2010, held in Jeju, South Korea in December 2010. The 77 revised full papers presented were carefully reviewed and selected from 182 submissions for inclusion in the book. This volume contains topics such as approximation algorithm; complexity; data structure and algorithm; combinatorial optimization; graph algorithm; computational geometry; graph coloring; fixed parameter tractability; optimization; online algorithm; and scheduling.

Detailangaben zum Buch - Algorithms and Computation by Otfried Cheong Paperback | Indigo Chapters


EAN (ISBN-13): 9783642175138
ISBN (ISBN-10): 3642175139
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2010
Herausgeber: Otfried Cheong
473 Seiten
Gewicht: 0,748 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2008-01-25T07:22:38+01:00 (Vienna)
Detailseite zuletzt geändert am 2023-06-15T20:19:53+02:00 (Vienna)
ISBN/EAN: 9783642175138

ISBN - alternative Schreibweisen:
3-642-17513-9, 978-3-642-17513-8
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: yong, kyung, jürgen neukirch, kun park, davis david, hong liang
Titel des Buches: island, algorithms part, whither korea, klassenkörpertheorie, lecture notes computer science, ufo symposium, isaac


Daten vom Verlag:

Autor/in: Otfried Cheong; Kyung-Yong Chwa; Kunsoo Park
Titel: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II
Verlag: Springer; Springer Berlin
474 Seiten
Erscheinungsjahr: 2010-12-02
Berlin; Heidelberg; DE
Sprache: Englisch
85,59 € (DE)
87,99 € (AT)
106,71 CHF (CH)
Contact supplier
XVIII, 474 p. 96 illus.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Computerprogrammierung und Softwareentwicklung; Verstehen; AAC; algorithms; combinatorial optimization; complexity; computational geometry; data structure; scheduling; algorithm analysis and problem complexity; data structures; Programming Techniques; Algorithms; Discrete Mathematics in Computer Science; Computer Communication Networks; Computer Graphics; Data Science; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Netzwerk-Hardware; Grafikprogrammierung; Datenbanken; EA

Session 6A. Data Structure and Algorithm II.- D2-Tree: A New Overlay with Deterministic Bounds.- Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets.- Dynamic Range Reporting in External Memory.- A Cache-Oblivious Implicit Dictionary with the Working Set Property.- Session 6B. Graph Algorithm II.- The (p,q)-total Labeling Problem for Trees.- Drawing a Tree as a Minimum Spanning Tree Approximation.- k-cyclic Orientations of Graphs.- Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size.- Session 7A. Computational Geometry II.- Maximum Overlap of Convex Polytopes under Translation.- Approximate Shortest Homotopic Paths in Weighted Regions.- Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane.- Session 7B. Graph Coloring II.- Approximation and Hardness Results for the Maximum Edge q-coloring Problem.- 3-Colouring AT-Free Graphs in Polynomial Time.- On Coloring Graphs without InducedForests.- Session 8A. Approximation Algorithm II.- On the Approximability of the Maximum Interval Constrained Coloring Problem.- Approximability of Constrained LCS.- Approximation Algorithms for the Multi-Vehicle Scheduling Problem.- On Greedy Algorithms for Decision Trees.- Session 8B. Online Algorithm.- Single and Multiple Device DSA Problem, Complexities and Online Algorithms.- The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications.- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing.- On the Continuous CNN Problem.- Session 9A. Scheduling.- Policies for Periodic Packet Routing.- Increasing Speed Scheduling and Flow Scheduling.- A Tighter Analysis of Work Stealing.- Approximating the Traveling Tournament Problem with Maximum Tour Length 2.- Session 9B. Data Structure and Algorithm III.- Alphabet Partitioning for Compressed Rank/Select and Applications.- Entropy-Bounded Representation of Point Grids.- Identifying ApproximatePalindromes in Run-Length Encoded Strings.- Session 10A. Graph Algorithm III.- Minimum Cost Partitions of Trees with Supply and Demand.- Computing the (t,k)-Diagnosability of Component-Composition Graphs and Its Application.- Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs.- Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization.- Induced Subgraph Isomorphism on Interval and Proper Interval Graphs.- Session 10B. Computational Geometry III.- Testing Simultaneous Planarity When the Common Graph Is 2-Connected.- Computing the Discrete Fréchet Distance with Imprecise Input.- Connectivity Graphs of Uncertainty Regions.- ?/2-Angle Yao Graphs Are Spanners.- Identifying Shapes Using Self-assembly.

Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:

Neuestes ähnliches Buch:
9783319046563 Algorithms and Computation (Sudebkumar Prasant Pal)


< zum Archiv...