Strong LP duality in weighted infinite bipartite graphs
نویسندگان
چکیده
We prove a weighted generalization of Kiinig’s duality theorem for infinite bipartite graphs and a weighted version of its dual.
منابع مشابه
Weighted Matchings in General Graphs
In the previous section we saw how we could use LP duality theory to develop an algorithm for the weighted matching problem in bipartite graphs. In this section, we’ll see how to extend that algorithm to handle general graphs. As in the unweighted case, blossom-shrinking plays a central role. However, in weighted graphs we will handle blossoms a bit differently. In particular, we will maintain ...
متن کاملOn a Duality Principle in Infinite Bipartite Graphs
We consider an extension of Konig's duality theorem to infinite bipartite graphs, conjectured by Erdo's. We prove an equivalence between this conjecture and another conjecture, and using the equivalence we prove it in certain cases.
متن کاملMaximum Weighted Independent Sets with a Budget
Given a graph G, a non-negative integer k, and a weight function that maps each vertex in G to a positive real number, the Maximum Weighted Budgeted Independent Set (MWBIS) problem is about finding a maximum weighted independent set in G of cardinality at most k. A special case of MWBIS, when the weight assigned to each vertex is equal to its degree in G, is called the Maximum Independent Verte...
متن کاملA Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes
Nonstationary infinite-horizon Markov decision processes (MDPs) generalize the most well-studied class of sequential decision models in operations research, namely, that of stationaryMDPs, by relaxing the restrictive assumption that problem data do not change over time. Linearprogramming (LP) has been very successful in obtaining structural insights and devising solutionmeth...
متن کاملWeighted coloring on planar, bipartite and split graphs: Complexity and approximation
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-hard in planar graphs, even if they are triangle-free and their maximum degree is bounded above by 4. Then, we prove that min weighted node coloring is NP-hard in P8-free bipartite graphs, but polynomial for P5-free bipartite graphs. We next focus on approxi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 131 شماره
صفحات -
تاریخ انتشار 1994