skutella martin (36 Ergebnisse)

Hardcover. Zustand: Very Good. Zustand des Schutzumschlags: No Dust Jacket. Pencil notes to some pages. ; Text in Latin; apparatus in Latin. Xxxi, 397 pp ; Bibliotheca Scriptorum Graecorum Et Romanorum Teubneriana TEUBNER; 12mo 7" - 7½" tall; 397 pages.

Hardcover. Zustand: Very Good+. Zustand des Schutzumschlags: No Dust Jacket. Very faint stain to front board. Tiny dent to lower edge of front board. ; Text in Latin; apparatus in Latin. Xxxi, 397 pp ; Bibliotheca Scriptorum Graecorum Et Romanorum Teubneriana TEUBNER; 12mo 7" - 7½" tall; 397 pages.

Hardcover. Zustand: Near Fine. Zustand des Schutzumschlags: No Dust Jacket. Former owner's name on ffep. Very minor shelfwear. ; Text in Latin; apparatus in Latin. Xxxi, 397 pp ; Bibliotheca Scriptorum Graecorum Et Romanorum Teubneriana TEUBNER; 16mo 6" - 7" tall; 397 pages.

Hardcover. Zustand: Fine. Zustand des Schutzumschlags: No Dust Jacket. Former owner's name on ffep. Very minor shelfwear. ; Text in Latin; apparatus in Latin. Xxxi, 397 pp ; Bibliotheca Scriptorum Graecorum Et Romanorum Teubneriana TEUBNER; 16mo 6" - 7" tall; 397 pages.

Paperback. Zustand: Brand New. revised edition. 220 pages. 9.00x6.00x0.50 inches. In Stock.

Paperback. Zustand: Brand New. 2008 edition. 287 pages. 9.25x6.25x0.75 inches. In Stock.

Zustand: New.

Taschenbuch. Zustand: Neu. Neuware -This book constitutes the thoroughly refereed post-workshopproceedings of the 13th International Workshop on Approximation andOnline Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015.The 17 revised full papers presented were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems,and real-world applications.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 220 pp. Englisch.

Zustand: New. 2018. Paperback. . . . . . Books ship from the US and Ireland.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015.The 17 revised full papers presented were carefully reviewed and selected from 40 submissions.Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmictrading, coloring and partitioning, competitive analysis, computational advertising,computational finance, cuts and connectivity, geometric problems, graphalgorithms, inapproximability, mechanism design, natural algorithms, networkdesign, packing and covering, paradigms for the design and analysis of approximationand online algorithms, parameterized complexity, scheduling problems,and real-world applications.

Taschenbuch. Zustand: Neu. Neuware -The Fifth Workshop on Approximation and Online Algorithms (WAOA 2007) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications from a variety of elds. WAOA 2007 took place in Eilat, Israel, during October 11¿12, 2007. The workshop was part of the ALGO 2007 event that also hosted ESA 2007, and PEGG 2007. The previous WAOA workshops were held in Budapest (2003), Rome (2004), Palma de Mallorca (2005) and Zurich (2006). The proceedings of these previous WAOA workshops have appeared as LNCS volumes 2909, 3351, 3879 and 4368, respectively. Topics of interest for WAOA 2007 were: algorithmic game theory, appro- mation classes, coloring and partitioning, competitive analysis, computational nance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems. In response to the call for - pers, we received 56 submissions. Each submission was reviewed by at least three referees, and the vast majority by at least four referees. The submissions were mainly judged on originality, technical quality, and relevance to the topics of the conference. Based on the reviews, the Program Committee selected 22 papers. We are grateful to Andrei Voronkov for providing the EasyChair conference system which was used to manage the electronic submissions, the review process, and the electronic PC meeting. It made our task much easier.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 304 pp. Englisch.

Taschenbuch. Zustand: Neu. Neuware -This book constitutes the thoroughly refereed post workshop proceedings of the 6th International Workshop on Approximation and Online Algorithms, WAOA 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 conference event. The 22 revised full papers presented were carefully reviewed and selected from 56 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, randomization techniques, real-world applications, and scheduling problems.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 304 pp. Englisch.

Taschenbuch. Zustand: Neu. Neuware -This book constitutes therefereed proceedings of the 18th International Conference on IntegerProgramming and Combinatorial Optimization, IPCO 2016, held in Liège, Belgiumin June 2016. The 33 full papers presented were carefully reviewed and selectedfrom 125 submissions. The conference is a forum for researchers andpractitioners working on various aspects of integer programming andcombinatorial optimization. The aim is to present recent developments intheory, computation, and applications in these areas. The scope of IPCO isviewed in a broad sense, to include algorithmic and structural results ininteger programming and combinatorial optimization as well as revealingcomputational studies and novel applications of discrete optimization topractical problems.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 428 pp. Englisch.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The Fifth Workshop on Approximation and Online Algorithms (WAOA 2007) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications from a variety of elds. WAOA 2007 took place in Eilat, Israel, during October 11-12, 2007. The workshop was part of the ALGO 2007 event that also hosted ESA 2007, and PEGG 2007. The previous WAOA workshops were held in Budapest (2003), Rome (2004), Palma de Mallorca (2005) and Zurich (2006). The proceedings of these previous WAOA workshops have appeared as LNCS volumes 2909, 3351, 3879 and 4368, respectively. Topics of interest for WAOA 2007 were: algorithmic game theory, appro- mation classes, coloring and partitioning, competitive analysis, computational nance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems. In response to the call for - pers, we received 56 submissions. Each submission was reviewed by at least three referees, and the vast majority by at least four referees. The submissions were mainly judged on originality, technical quality, and relevance to the topics of the conference. Based on the reviews, the Program Committee selected 22 papers. We are grateful to Andrei Voronkov for providing the EasyChair conference system which was used to manage the electronic submissions, the review process, and the electronic PC meeting. It made our task much easier.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the thoroughly refereed post workshop proceedings of the 6th International Workshop on Approximation and Online Algorithms, WAOA 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 conference event. The 22 revised full papers presented were carefully reviewed and selected from 56 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, randomization techniques, real-world applications, and scheduling problems.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes therefereed proceedings of the 18th International Conference on IntegerProgramming and Combinatorial Optimization, IPCO 2016, held in Liège, Belgium,in June 2016. The 33 full papers presented were carefully reviewed and selectedfrom 125 submissions. The conference is a forum for researchers andpractitioners working on various aspects of integer programming andcombinatorial optimization. The aim is to present recent developments intheory, computation, and applications in these areas. The scope of IPCO isviewed in a broad sense, to include algorithmic and structural results ininteger programming and combinatorial optimization as well as revealingcomputational studies and novel applications of discrete optimization topractical problems.

Zustand: New.

Paperback. Zustand: Brand New. 412 pages. 9.25x6.10x0.97 inches. In Stock.

Taschenbuch. Zustand: Neu. Neuware -Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks.This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 160 pp. Englisch.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks.This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 304 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 304 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Hardcover. Zustand: Brand New. 160 pages. 9.25x6.25x0.75 inches. In Stock.

Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Orig.-Broschur; Zustand: Gut. VIII, 97 S. ; gr. 8°; Der Einband mit Gebrauchsspuren, Nummer auf Einband notiert, sonst sehr gut. /lager 0102 Sprache: Deutsch Gewicht in Gramm: 600.

DMV, Saarbrücken, 2010. Zusammen 256 S. mit zahlr. Abb., kartoniert--- - gute Exemplare - 802 Gramm.

DMV, Saarbrücken, 2012. Zusammen 256 S. mit zahlr. Abb., kartoniert--- - gute Exemplare - 790 Gramm.

DMV, Saarbrücken, 2011. Zusammen 248 S. mit zahlr. Abb., kartoniert--- - gute Exemplare - 768 Gramm.

DMV, Saarbrücken, 2009. Zusammen 256 S. mit zahlr. Abb., kartoniert (teils Adressaufkleber auf Einband)--- 794 Gramm.