Journal Article10.1017/cbo9780511977152.003
Iterative Methods in Combinatorial Optimization
Lap Chi Lau,R. Ravi,Mohit Singh,Yang D Li +3 more
- 18 Apr 2011
99
TL;DR: With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility.
read more
Abstract: With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence, and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Analytics for an Online Retailer: Demand Forecasting and Price Optimization
TL;DR: This work develops an algorithm to efficiently solve the subsequent multiproduct price optimization that incorporates reference price effects, and creates and implements this algorithm into a pricing decision support tool for Rue La La's daily use.
Resource Allocation for D2D Communication Underlaid Cellular Networks Using Graph-Based Approach
TL;DR: This paper proposes an iterative rounding algorithm and an optimal branch-and-bound (BnB) algorithm to solve the non-orthogonal dynamic spectrum sharing for device-to-device (D2D) communications in the D2D underlaid cellular network and proves that it achieves at least 1/2 of the optimal weighted sum-rate.
85
Additive approximation for bounded degree survivable network design
Lap Chi Lau,Mohit Singh +1 more
- 17 May 2008
TL;DR: These results provide the first additive approximation algorithms for finding low degree subgraphs including Steiner forests, k -edge-connected sub graphs, and Steiner networks and achieve the best known guarantees for both the total cost and the degree violation simultaneously.
The Moser--Tardos Framework with Partial Resampling
TL;DR: The resampling algorithm of Moser and Tardos is a powerful approach to develop constructive versions of the Lovász Local Lemma, and this work generalizes this to partial resampled: When a bad event holds, an appropriately random subset of the variables that define this event rather than the entire set is resample.
Approximate Random Allocation Mechanisms
Mohammad Akbarpour,Afshin Nikzad +1 more
TL;DR: In this paper, the authors generalize the scope of random allocation mechanisms and show that if some of the feasibility constraints can be treated as goals rather than hard constraints, then, subject to weak conditions that they identify, any expected allocation that satisfies all constraints and goals can be implemented by randomizing among nearby integer allocations that satisfy all the hard constraints exactly and the goals approximately.
46
References
The Hungarian method for the assignment problem
TL;DR: This paper has always been one of my favorite children, combining as it does elements of the duality of linear programming and combinatorial tools from graph theory, and it may be of some interest to tell the story of its origin this article.
Reducibility Among Combinatorial Problems.
Richard M. Karp
- 01 Jan 1972
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
13.6K
•Book
Theory of Linear and Integer Programming
Alexander Schrijver
- 01 Dec 1986
TL;DR: Introduction and Preliminaries.
The complexity of theorem-proving procedures
Stephen A. Cook
- 03 May 1971
TL;DR: It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology.
7.4K
On the shortest spanning subtree of a graph and the traveling salesman problem
Joseph B. Kruskal
- 01 Feb 1956
TL;DR: Kurosh and Levitzki as discussed by the authors, on the radical of a general ring and three problems concerning nil rings, Bull Amer Math Soc vol 49 (1943) pp 913-919 10 -, On the structure of algebraic algebras and related rings.