Pierluigi Crescenzi - Böcker
Visar alla böcker från författaren Pierluigi Crescenzi. Handla med fri frakt och snabb leverans.
4 produkter
4 produkter
Algorithms and Complexity
Second Italian Conference, CIAC '94, Rome, Italy, February 23 - 25, 1994. Proceedings
Häftad, Engelska, 1994
552 kr
Skickas inom 10-15 vardagar
The papers in this volume were presented at the SecondItalian Conference onAlgorithms and Complexity, held inFebruary 1994 in Rome. This biannual conference series isintended to present research contributions in theory andapplications of sequential, parallel, and distributedalgorithms, data structures, and computational complexity. The volume contains four invited presentations and 14regular presentations selected from 32 submissions, each ofwhich was evaluated by at least four program committeemembers. The invited presentations are by J. Hartmanis andS. Chari, A. Garg and R. Tamassia, S. C. Sahinalp and U. Vishkin, and M. Yannakakis.
Complexity and Approximation
Combinatorial Optimization Problems and Their Approximability Properties
Inbunden, Engelska, 1999
905 kr
Skickas inom 10-15 vardagar
This book is an up-to-date documentation of the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The well-structured wealth of problems, algorithms, results, and techniques introduced systematically will make the book an indispensible source of reference for professionals. The smooth integration of numerous illustrations, examples, and exercises make this monograph an ideal textbook.
Fun with Algorithms
4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings
Häftad, Engelska, 2007
552 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 4th International Conference on Fun with Algorithms, FUN 2007, held in Castiglioncello, Italy in June 2007. It details the use, design, and analysis of algorithms and data structures, focusing on results that provide amusing, witty, but nonetheless original and scientifically profound, contributions to the area.
Complexity and Approximation
Combinatorial Optimization Problems and Their Approximability Properties
Häftad, Engelska, 2013
747 kr
Skickas inom 10-15 vardagar
N COMPUTER applications we are used to live with approximation. Var I ious notions of approximation appear, in fact, in many circumstances. One notable example is the type of approximation that arises in numer ical analysis or in computational geometry from the fact that we cannot perform computations with arbitrary precision and we have to truncate the representation of real numbers. In other cases, we use to approximate com plex mathematical objects by simpler ones: for example, we sometimes represent non-linear functions by means of piecewise linear ones. The need to solve difficult optimization problems is another reason that forces us to deal with approximation. In particular, when a problem is computationally hard (i. e. , the only way we know to solve it is by making use of an algorithm that runs in exponential time), it may be practically unfeasible to try to compute the exact solution, because it might require months or years of machine time, even with the help of powerful parallel computers. In such cases, we may decide to restrict ourselves to compute a solution that, though not being an optimal one, nevertheless is close to the optimum and may be determined in polynomial time. We call this type of solution an approximate solution and the corresponding algorithm a polynomial-time approximation algorithm. Most combinatorial optimization problems of great practical relevance are, indeed, computationally intractable in the above sense. In formal terms, they are classified as Np-hard optimization problems.