Odd minimum cut sets and b-matchings revisited
Adam N. Letchford, Dirk Oliver Theis
Abstract
The famous Padberg-Rao separation algorithm for b-matching polyhedra can be implemented to run in O(n2m log(n2/m)) time in the uncapacitated case, and in O(nm2 log(n2/m)) time in the capacitated case (where n is the number of vertices and m is the number of edges of the underlying graph). We give a new and simple algorithm for the capacitated case which can be implemented to run in O(n2m log(n2/m)) time.
Create a lesson
Related papers
Dec-BFTRL: Squre-Root Regret for Decentralized Online Upper-Linearizable Optimization under Separation Access with Application to Continuous Submodular Maximization
Yiyang Lu, Mohammad Pedramfar, Vaneet Aggarwal
Decentralized Strategies for Finite Population LQG Social Control: A Reinforcement Learning Approach
Liangyuan Guo, Bing-Chang Wang, Guangchen Wang
Enhancing Interpretability of Stochastic Programming Solutions: A Multiparametric Approach
Parth Brahmbhatt, Styliani Avraamidou
Multi-Agent Receding Horizon Games Framework for Autonomous Market Participation
Parth Brahmbhatt, Styliani Avraamidou
Solution and Optimal Strategies for a Differential Game of Pursuit-Evasion with Point-Wise Constraints
Jamilu Adamu, Abbas Ja'afaru Badakaya, Felix Wallace Tarry et al.
Analysis of First-Order Linear Pursuit and Evasion Differential Games with Gronwall-Type Constraints
David Terna Gbande, Abbas Ja'afaru Badakaya, Jamilu Adamu et al.