Kratsch dieter (13 Ergebnisse)

Zustand: New. In English.

Zustand: New. In English.

Zustand: New. In English.

Paperback. Zustand: Brand New. 1st edition. 341 pages. 9.00x6.00x1.00 inches. In Stock.

Paperback. Zustand: Brand New. 2014 edition. 436 pages. 9.25x6.10x0.94 inches. In Stock.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad). The running time of slow algorithms is usually exponential. This book is about bad algorithms. There are several reasons why we are interested in exponential time algorithms. Most of us believe that there are many natural problems which cannot be solved by polynomial time algorithms. The most famous and oldest family of hard problems is the family of NP complete problems. Most likely there are no polynomial time al gorithms solving these hard problems and in the worst case scenario the exponential running time is unavoidable. Every combinatorial problem is solvable in nite time by enumerating all possi ble solutions, i. e. by brute force search. But is brute force search always unavoid able De nitely not. Already in the nineteen sixties and seventies it was known that some NP complete problems can be solved signi cantly faster than by brute force search. Three classic examples are the following algorithms for the TRAVELLING SALESMAN problem, MAXIMUM INDEPENDENT SET, and COLORING.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005) was held on the campus Ile du Saulcy of the Univ- sity Paul Verlaine-Metz in France. The workshop was organized by the La- ratoire d Informatique Th eorique et Appliqu ee (LITA) and it took place June 23 25 2005. The 94 participants of WG 2005 came from universities and - search institutes of 18 di erent countries. The WG 2005 workshop continues the series of 30 previous WG workshops. Since 1975,WG has taken place 20 times in Germany, four times in The Neth- lands,twotimesinAustriaaswellasonceinItaly,inSlovakia,inSwitzerlandand inCzechRepublic, andhas nowbeen heldfor the rsttime inFrance.The wo- shop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The talks were given in the Petit Th eatre . They showed how recent research results from algori- mic graph theory can be used in computer science and which graph-theoretic questions arise from new developments in computer science. There were two fascinating invited lectures by Georg Gottlob (Vienna, Austria) and Gregory Kucherov (Nancy, France).…

Kartoniert / Broschiert. Zustand: New. This book constitutes the thoroughly refereed post-proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007, held in Dornburg, Germany, in June 2007. The 30 revised full papers presented together with one in.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad). The running time of slow algorithms is usually exponential. This book is about bad algorithms. There are several reasons why we are interested in exponential time algorithms. Most of us believe that there are many natural problems which cannot be solved by polynomial time algorithms. The most famous and oldest family of hard problems is the family of NP complete problems. Most likely there are no polynomial time al gorithms solving these hard problems and in the worst case scenario the exponential running time is unavoidable. Every combinatorial problem is solvable in nite time by enumerating all possi ble solutions, i. e. by brute force search. But is brute force search always unavoid able De nitely not. Already in the nineteen sixties and seventies it was known that some NP complete problems can be solved signi cantly faster than by brute force search. Three classic examples are the following algorithms for the TRAVELLING SALESMAN problem, MAXIMUM INDEPENDENT SET, and COLORING.…

Taschenbuch. Zustand: Neu. Graph-Theoretic Concepts in Computer Science | 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers | Dieter Kratsch (u. a.) | Taschenbuch | Lecture Notes in Computer Science | xi | Englisch | 2014 | Springer | EAN 9783319123394 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

kart. Zustand: Sehr gut. 144 S.; Ill. (z.T. farb.), Kt.; 18 cm, 120 g - sauberes Buch in altersgemäß sehr gutem Zustand: Einband u. Innenteil mit geringen Spuren, Bindung fest, Seiten hell und sauber, keinerlei Eintragungen oder Unterstreichungen (siehe auch meine Fotos) [ab] --- für einen Blick ins Inhaltsverzeichnis beachten Sie bitte mein Foto Nr. 3 Sprache: Deutsch Gewicht in Gramm: 120.…

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

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