Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Global Connectivity Problems.
Chandra ChekuriKent QuanrudPublished in: CoRR (2021)
Keyphrases
- optimization problems
- practical problems
- benchmark problems
- learning algorithm
- machine learning algorithms
- problems in computer vision
- computationally efficient
- orders of magnitude
- specific problems
- significant improvement
- difficult problems
- related problems
- highly efficient
- computational problems
- theoretical guarantees
- test problems
- combinatorial optimization
- hard problems
- worst case
- computational cost
- computational complexity
- data sets
- exact and approximate
- np hard problems
- iterative algorithms
- partial solutions
- graph theory
- times faster
- np complete
- decision trees