- 4 Ergebnisse
Kleinster Preis: € 42,79, größter Preis: € 74,96, Mittelwert: € 66,92
1
Algorithms - ESA '97 - Rainer Burkard; Gerhard Woeginger
Bestellen
bei Springer.com
€ 74,96
Bestellen
Details und Versand
gesponserter Link
Rainer Burkard; Gerhard Woeginger:

Algorithms - ESA '97 - neues Buch

ISBN: 9783540695363

This book constitutes the refereed proceedings of the 5th Annual International European Symposium on Algorithms, ESA'97, held in Graz, Austria, September 1997. The 38 revised full papers … Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
2
Algorithms - ESA '97
Bestellen
bei Springer.com
€ 42,79
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link

ESA '97:

Algorithms - neues Buch

ISBN: 9783540695363

This book constitutes the refereed proceedings of the 5th Annual International European Symposium on Algorithms, ESA'97, held in Graz, Austria, September 1997. The 38 revised full papers … Mehr…

Nr. 978-3-540-69536-3. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00)
zuklappen (X)
3
Algorithms - ESA '97 - Rainer Burkard; Gerhard Woeginger
Bestellen
bei Springer.com
€ 74,96
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Rainer Burkard; Gerhard Woeginger:
Algorithms - ESA '97 - neues Buch

ISBN: 9783540695363

Computer Science; Theory of Computation; Algorithm Analysis and Problem Complexity; Computer Graphics; Discrete Mathematics in Computer Science; Computer Communication Networks; Combinato… Mehr…

  - Versandkosten: EUR 0.00
zuklappen (X)
4
Algorithms - ESA '97 - Rainer Burkard; Gerhard Woeginger
Bestellen
bei Springer.com
€ 74,96
Bestellen
Details und Versand
gesponserter Link
Rainer Burkard; Gerhard Woeginger:
Algorithms - ESA '97 - neues Buch

ISBN: 9783540695363

Computer Science; Theory of Computation; Algorithm Analysis and Problem Complexity; Computer Graphics; Discrete Mathematics in Computer Science; Computer Communication Networks; Combinato… Mehr…

  - Versandkosten:zzgl. Versandkosten.
zuklappen (X)
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 - ESA '97
Autor:
Titel:
ISBN-Nummer:

9783540695363

Detailangaben zum Buch - Algorithms - ESA '97


EAN (ISBN-13): 9783540695363
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2017-03-24T14:25:31+01:00 (Zurich)
Detailseite zuletzt geändert am 2024-01-31T14:35:49+01:00 (Zurich)
ISBN/EAN: 9783540695363

ISBN - alternative Schreibweisen:
978-3-540-69536-3
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: esa, algorithms

Daten vom Verlag:

Autor/in: Rainer Burkard; Gerhard Woeginger
Titel: Lecture Notes in Computer Science; Algorithms - ESA '97 - 5th Annual European Symposium, Graz, Austria, September 15-17, 1997. Proceedings
Verlag: Springer; Springer Berlin
524 Seiten
Erscheinungsjahr: 2005-09-15
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XII, 524 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; algorithm; algorithms; combinatorial optimization; data compression; distributed computing; evolutionary algorithm; optimization; algorithm analysis and problem complexity; combinatorics; C; Theory of Computation; Algorithms; Computer Graphics; Discrete Mathematics in Computer Science; Computer Communication Networks; Discrete Mathematics; Computer Science; Algorithmen und Datenstrukturen; Grafikprogrammierung; Mathematik für Informatiker; Diskrete Mathematik; Netzwerk-Hardware; BC

Scheduling independent multiprocessor tasks.- On local search for weighted ?-set packing.- On-line machine covering.- Area-efficient static and incremental graph drawings.- Denesting by bounded degree radicals.- a linear time algorithm for the arc disjoint Menger problem in planar directed graphs.- Distance approximating trees for chordal and dually chordal graphs.- Decomposition of integer programs and of generating sets.- Bounded degree spanning trees.- Optimal adaptive broadcasting with a bounded fraction of faulty nodes.- Weighted graph separators and their applications.- A new exact algorithm for general orthogonal d-dimensional knapsack problems.- Dynamic data structures for realtime management of large geometric scenes.- Solving rectilinear Steiner tree problems exactly in theory and practice.- Dynamically switching vertices in planar graphs.- A new family of randomized algorithms for list accessing.- On-line construction of two-dimensional suffix trees.- Scheduling multiclass queueing networks on parallel servers: Approximate and heavy-traffic optimality of Klimov's priority rule.- Optimal reconstruction of graphs under the additive model.- Fixing variables in semidefinite relaxations.- Test sets of the knapsack problem and simultaneous diophantine approximation.- Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing.- Fault-tolerant real-time scheduling.- Collecting garbage pages in a distributed shared memory with reduced memory and communication overhead.- Quasi-fully dynamic algorithms for two-connectivity, cycle equivalence and related problems.- Minimum spanning trees in d dimensions.- Relaxed balance for search trees with local rebalancing.- Improved approximations for minimum cardinality quadrangulations of finiteelement meshes.- Dynamic storage allocation with known durations.- Coloring in sublinear time.- Competitive analysis of on-line stack-up algorithms.- Scheduling-LPs bear probabilities randomized approximations for min-sum criteria.- On piercing sets of axis-parallel rectangles and rings.- Seven problems: So different yet close.- Linear-time reconstruction of Delaunay triangulations with applications.- Approximating satisfiable satisfiability problems.- Algorithms for computing signs of 2 x 2 determinants: Dynamics and average-case analysis.- Reconstructing the topology of a CAD model - A discrete approach -.
< zum Archiv...