Teo chungpiaw (3 risultati)

Condizione: New.

Paperback. Condizione: New. Print on Demand. This book provides an in-depth analysis of the "parsimonious" property of cut covering problems, a class of combinatorial challenges that encompass well-known issues like the Steiner tree and traveling salesman conundrums. The author initially presents a set of conditions that, when met by a set function, will guarantee the parsimonious property. This property implies that degree constraints in the linear programming relaxation of cut covering problems can be omitted without affecting the optimal solution, an observation that has spurred significant advancements in the field. The author continues by examining various implications of this property, including monotonicity properties of the linear programming relaxation and the integrality of polyhedra associated with these problems. In doing so, this book unifies and expands upon several previously independent results, revealing the underlying connections between them. Additionally, the author proposes new methods for analyzing the worst-case performance of approximation algorithms for cut covering problems and introduces a novel approximation algorithm that is simpler to implement than existing methods. This book provides a comprehensive understanding of the parsimonious property and its significance in addressing cut covering problems, offering valuable insights for researchers and practitioners working in combinatorial optimization and related areas. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…

Condizione: New. Print on Demand pp. 38.