This symposium is jointly sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group on Discrete Mathematics.

Annotation Proceedings of a conference that took place in Austin, Texas in January 1993. Contributors are impressive names from the field of computer science, including Donald Knuth, author of several computer books of "biblical" importance. The diverse selection of paper topics includes dynamic point location, ray shooting, and the shortest paths in planar maps; optimistic sorting and information theoretic complexity; and an optimal randomized algorithm for the cow-path problem. No index. Annotation copyright by Book News, Inc., Portland, OR.

Contains 130 papers, which were selected based on originality, technical contribution, and relevance. Although the papers were not formally refereed, every attempt was made to verify the main claims. It is expected that most will appear in more complete form in scientific journals. The proceedings also includes the paper presented by invited plenary speaker Ronald Graham, as well as a portion of the papers presented by invited plenary speakers Udi Manber and Christos Papadimitriou.

From the January 2003 symposium come just over 100 papers addressing a range of topics related to discrete algorithms. Examples of topics covered include packing Steiner trees, counting inversions in lists, directed scale-free graphs, quantum property testing, and improved results for directed multicut. The papers were not formally refereed, but attempts were made to verify major results. Annotation (c)2003 Book News, Inc., Portland, OR (booknews.com)

One of the most frequently occurring types of optimization problems involves decision variables which have to take integer values. From a practical point of view, such problems occur in countless areas of management, engineering, administration, etc., and include such problems as location of plants or warehouses, scheduling of aircraft, cutting raw materials to prescribed dimensions, design of computer chips, increasing reliability or capacity of networks, etc. This is the class of problems known in the professional literature as "discrete optimization" problems. While these problems are of enormous applicability, they present many challenges from a computational point of view. This volume is an update on the impressive progress achieved by mathematicians, operations researchers, and computer scientists in solving discrete optimization problems of very large sizes. The surveys in this volume present a comprehensive overview of the state of the art in discrete optimization and are written by the most prominent researchers from all over the world.This volume describes the tremendous progress in discrete optimization achieved in the last 20 years since the publication of Discrete Optimization '77, Annals of Discrete Mathematics, volumes 4 and 5, 1979 (Elsevier). It contains surveys of the state of the art written by the most prominent researchers in the field from all over the world, and covers topics like neighborhood search techniques, lift and project for mixed 0-1 programming, pseudo-Boolean optimization, scheduling and assignment problems, production planning, location, bin packing, cutting planes, vehicle routing, and applications to graph theory, mechanics, chip design, etc.Key features:• state of the art surveys• comprehensiveness• prominent authors• theoretical, computational and applied aspects.This book is a reprint of Discrete Applied Mathematics Volume 23, Numbers 1-3

This volume comprises the select proceedings of the annual convention of the Computer Society of India. Divided into 10 topical volumes, the proceedings present papers on state-of-the-art research, surveys, and succinct reviews. The volumes cover diverse topics ranging from communications networks to big data analytics, and from system architecture to cyber security. This volume focuses on Big Data Analytics. The contents of this book will be useful to researchers and students alike.

This book constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008. The 20 revised full papers of the APPROX 2008 workshop were carefully reviewed and selected from 42 submissions and focus on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM 2008 is concerned with applications of randomness to computational and combinatorial problems and accounts for 27 revised full papers, also diligently reviewed and selected out of 52 workshop submissions.