evripidis bampis (28 Ergebnisse)

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.

Zustand: New. pp. 364 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Paperback. Zustand: Brand New. spiral-bound edition. 255 pages. 9.00x6.00x0.50 inches. In Stock.

Paperback. Zustand: Brand New. 1st edition. 349 pages. 9.25x6.25x0.75 inches. In Stock.

Paperback. Zustand: Brand New. revised edition. 268 pages. 9.25x6.10x0.59 inches. In Stock.

Paperback. Zustand: Brand New. 2015 edition. 284 pages. 9.25x6.10x0.64 inches. In Stock.

Zustand: New. In.

Kartoniert / Broschiert. Zustand: New. Up-to-date resultsFast track conference proceedingState-of-the-art reportWAOA 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 Ap.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the thoroughly refereed post-workshop proceedings of the 12th International Workshop on Approximation and Online Algorithms, WAOA 2014, held in Wroclaw, Poland, in September 2014 as part of ALGO 2014. The 22 revised full papers presented were carefully reviewed and selected from 49 submissions. They cover a wide range of topics such as coloring and partitioning, competitive analysis, 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 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 the refereed proceedings of the 14th International Symposium on Experimental Algorithms, SEA 2015, held in Paris, France, in June/July 2015.The 30 revised full papers presented were carefully reviewed and selected from 76 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. The papers are grouped in topical sections on data structures, graph problems, combinatorial optimization, scheduling and allocation, and transportation networks.

Paperback. Zustand: Brand New. 2015 edition. 416 pages. 9.00x6.00x1.00 inches. In Stock.

Taschenbuch. Zustand: Neu. Approximation and Online Algorithms | 12th International Workshop, WAOA 2014, Wroc¿aw, Poland, September 11-12, 2014, Revised Selected Papers | Evripidis Bampis (u. a.) | Taschenbuch | Lecture Notes in Computer Science | x | Englisch | 2015 | Springer | EAN 9783319182629 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Approximation and Online Algorithms | 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008, Revised Papers | Evripidis Bampis (u. a.) | Taschenbuch | x | Englisch | 2009 | Springer | EAN 9783540939795 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Experimental Algorithms | 14th International Symposium, SEA 2015, Paris, France, June 29 - July 1, 2015, Proceedings | Evripidis Bampis | Taschenbuch | Lecture Notes in Computer Science | xi | Englisch | 2015 | Springer | EAN 9783319200859 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Efficient Approximation and Online Algorithms | Recent Progress on Classical Combinatorial Optimization Problems and New Applications | Evripidis Bampis (u. a.) | Taschenbuch | viii | Englisch | 2006 | Springer | EAN 9783540322122 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019.The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 submissions. Topics of interest for WAOA 2018 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.

Taschenbuch. Zustand: Neu. Approximation and Online Algorithms | 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers | Evripidis Bampis (u. a.) | Taschenbuch | xii | Englisch | 2020 | Springer | EAN 9783030394783 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Neuware - The 7th Workshop on Approximation and Online Algorithms (WAOA 2009) focused on the design and analysis of algorithms for online and computati- ally hard problems. Both kinds of problems have a large number of applications from a variety of elds. WAOA 2009 took place in Copenhagen, Denmark, d- ing September 10 11, 2009. The workshop was part of the ALGO 2009 event that also hosted ESA 2009, IWPEC 2009, and ATMOS 2009. The previous WAOA workshops were held in Budapest (2003), Rome (2004), Palma de M- lorca(2005),Zurich(2006),Eilat(2007),andKarlsruhe(2008).The proceedings ofthesepreviousWAOAworkshopshaveappearedasLNCSvolumes2909,3351, 3879, 4368, 4927, and 5426, respectively. Topics of interest for WAOA 2009 were: algorithmic game theory, appr- imation 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 approximationand online algorithms,parameterizedcomplexity, randomization techniques, real-world applications, and scheduling problems. In response to the call for papers, we received 62 submissions. Each subm- sionwasreviewedbyatleastthreereferees,andthevastmajoritybyatleastfour referees. The submissions were mainly judged on originality, technical quality, andrelevanceto the topics of the conference.Basedon the reviews,the Program Committee selected 22 papers. We are grateful to Andrei Voronkov for providing the EasyChair conference system,whichwasusedtomanagetheelectronicsubmissions,thereviewproces s, and the electronic PC meeting. It made our task much easier. We would also like to thank all the authors who submitted papers to WAOA 2009 as well as the local organizers of ALGO 2009.

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

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 304 | Sprache: Englisch | Produktart: Bücher | 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. Fundamentals of Computation Theory | 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings | Evripidis Bampis (u. a.) | Taschenbuch | Lecture Notes in Computer Science | xix | Englisch | 2021 | Springer | EAN 9783030865924 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the proceedings of the 23rd International Symposium on Fundamentals of Computation Theory, FCT 2021, held in Athens, Greece, in September 2021. The 30 full papers included in this volume were carefully reviewed and selected from 94 submissions. In addition, the book contains 2 invited talks. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.