Wyniki wyszukiwania:

Constitutes the proceedings of the 15th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2011, held in New York, USA in June 2011.

This coherent anthology presents the state of the art in the booming area of online algorithms and competitive analysis of such algorithms. The 17 papers are carefully revised and thoroughly improved versions of presentations given first during a Dagstuhl seminar in 1996.
An overview by the volume editors introduces the area to the reader. The technical chapters are devoted to foundational and methodological issues for the design and analysis of various classes of online algorithms as well as to the detailed evaluation of algorithms for various activities in online processing, ranging from...

These 33 revised papers from the International IPCO Conference held in June 1999 cover theoretical, computational and application-oriented aspects of approximation algorithms, branch and bound algorithms, computational biology, computational complexity, computational geometry, cutting plane algorithms, diaphantine equations, geometry of numbers, graph and network algorithms, online algorithms, polyhedral combinatorics, scheduling and semidefinite programs.