CS 787 : Advanced Algorithms Flows and Cuts
نویسنده
چکیده
This lecture covers the construction of optimal flows and cuts in networks, their relationship, and some applications. It paves the way to our subsequent treatment of linear programming. The network flow and cut algorithms do not follow any of the paradigms we discussed so far, not do they represent a paradigm of their own. The applications we will present illustrate the paradigm of efficient reductions.
منابع مشابه
CS 787 : Advanced Algorithms Linear Programming
Instructor: Dieter van Melkebeek This lecture covers the notion of a linear program, its dual, and the relationship between the two. We give some examples and survey known algorithms. A linear program (LP) is the problem of optimizing (maximizing or minimizing) a linear multivariate objective function over the reals under linear equality and inequality (≤) constraints.
متن کاملCS 787 : Advanced Algorithms Scribe :
In this course we will study techniques for designing and analyzing algorithms. Undergraduate algorithms courses typically cover techniques for designing exact, efficient (polynomial time) algorithms. The focus of this course is different. We will consider problems for which polynomial time exact algorithms are not known, problems under stringent resource constraints, as well as problems for wh...
متن کاملCS 787 : Advanced Algorithms LP - Based Approximations
We present methods for constructing approximation algorithms to NP-hard optimization problems using linear programming (LP). We typically obtain an LP relaxation of the problem by formulating it as an integer linear program and dropping the integrality constraints. We then solve the LP relaxation exactly, and apply various rounding strategies (including randomized rounding and iterative roundin...
متن کاملCS 787 : Advanced Algorithms Greed
An algorithm that uses the greedy method attempts to construct an optimal (compound) solution to a problem by optimally constructing components one by one. In general, building up locally optimal components may not yield a globally optimal overall solution, but a greedy algorithm will give an optimal result if these two coincide. There are two main issues that arise when applying the greedy app...
متن کاملar X iv : c s / 06 07 10 9 v 1 [ cs . D M ] 2 5 Ju l 2 00 6 Complexity and Applications of Edge - Induced Vertex - Cuts
Motivated by hypergraph decomposition algorithms, we introduce the notion of edge-induced vertex-cuts and compare it with the well-known notions of edge-cuts and vertex-cuts. We investigate the complexity of computing minimum edge-induced vertex-cuts and demonstrate the usefulness of our notion by applications in network reliability and constraint satisfaction.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014