Gerhard woeginger (50 Ergebnisse)

Zustand: New.

Broschiert. Zustand: Gut. 436 Seiten; Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaftlichen Bibliothek und trägt die entsprechenden Kennzeichnungen (Rückenschild, Instituts-Stempel.); Schnitt und Einband sind etwas staubschmutzig; der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. Text in ENGLISCHER Sprache! Sprache: Englisch Gewicht in Gramm: 600.…

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: New.

Zustand: New.

Zustand: New.

Zustand: New.

Paperback. Zustand: Brand New. 590 pages. 9.00x6.00x1.25 inches. In Stock.

Paperback. Zustand: New. 1997 ed. 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 presented were selected from 112 submitted papers. The papers address a broad spectrum of theoretical and applicational aspects in algorithms theory and design. Among the topics covered are approximation algorithms, graph and network algorithms, combinatorial optimization, computational biology, computational mathematics, data compression, distributed computing, evolutionary algorithms, neural computing, online algorithms, parallel computing, pattern matching, and others.…

Zustand: New.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering.

Zustand: New.

Zustand: New.

Zustand: New.

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: As New. Unread book in perfect condition.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 7th International Symposium on Parameterized and Exact Computation, IPEC 2012, in Ljubljana, Slovenia, in September 2012. The 21 revised full papers presented together with 2 keynote talks were carefully reviewed and selected from 37 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and exact algorithms; fixed-parameter tractability results; parameterized complexity theory; relationship between parameterized complexity and traditional complexity classifications; applications of parameterized and exact computation; and implementation issues of parameterized and exact algorithms.…

Zustand: New.

Paperback. Zustand: Brand New. 448 pages. 9.25x6.10x1.01 inches. In Stock.

Paperback. Zustand: Brand New. 445 pages. 9.00x6.00x1.00 inches. In Stock.

Zustand: New.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances.- Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts.- Solving the Convex Cost Integer Dual Network Flow Problem.- Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem.- Valid Inequalities for Problems with Additive Variable Upper Bounds.- A Min-Max Theorem on Feedback Vertex Sets (Preliminary Version).- On the Separation of Maximally Violated mod-k Cuts.- Improved Approximation Algorithms for Capacitated Facility Location Problems.- Optimal 3-Terminal Cuts and Linear Programming.- Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem.- Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.- Universally Maximum Flow with Piecewise-Constant Capacities.- Critical Extreme Points of the 2-Edge Connected Spannning Subgraph Polytope.- An Orientation Theorem with Parity Conditions.- Parity Constrained k-Edge-Connected Orientations.- Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs.- On the Chvátal Rank of Certain Inequalities.- The Square-Free 2-Factor Problem in Bipartite Graphs.- The m-Cost ATSP.- A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem.- Edge-Splitting Problems with Demands.- Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors.- Optimal Compaction of Orthogonal Grid Drawings (Extended Abstract).- On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms.- Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow.- Approximation Algorithms for a Directed Network Design Problem.- Optimizing over AllCombinatorial Embeddings of a Planar Graph (Extended Abstract).- A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts.- Scheduling Two Machines with Release Times.- An Introduction to Empty Lattice Simplices.- On Optimal Ear-Decompositions of Graphs.- Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications (Extended Abstract).- Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 presented were selected from 112 submitted papers. The papers address a broad spectrum of theoretical and applicational aspects in algorithms theory and design. Among the topics covered are approximation algorithms, graph and network algorithms, combinatorial optimization, computational biology, computational mathematics, data compression, distributed computing, evolutionary algorithms, neural computing, online algorithms, parallel computing, pattern matching, and others.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the revised selected papers of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2017, held in Eindhoven, The Netherlands, in June 2017.The 31 full papers presented in this volume were carefully reviewed and selected from 71 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising directions of future research.…

Kartoniert / Broschiert. Zustand: New. Unique visibility Fast-track conference proceedings State-of-the-art researchThis book constitutes the proceedings of the 15th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2011, held in New Yo.