A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems

16 December 2016

Papers citing "A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems"

9 / 9 papers shown

Title
Efficient Linear Attention for Fast and Accurate Keypoint Matching Suwichaya Suwanwimolkul S. Komorita 3DPC 3DV 22 11 0 16 Apr 2022
RAMA: A Rapid Multicut Algorithm on GPU A. Abbas Paul Swoboda 46 9 0 04 Sep 2021
Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths Andrea Hornáková Timo Kaiser Paul Swoboda Michal Rolínek Bodo Rosenhahn Roberto Henschel VOT 45 37 0 24 Aug 2021
Fusion Moves for Graph Matching Lisa Hutschenreiter Stefan Haller Lorenz Feineis Carsten Rother Dagmar Kainmüller Bogdan Savchynskyy 30 15 0 28 Jan 2021
Discrete graphical models -- an optimization perspective Bogdan Savchynskyy 26 26 0 24 Jan 2020
Synchronisation of Partial Multi-Matchings via Non-negative Factorisations Florian Bernard J. Thunberg Jorge M. Gonçalves Christian Theobalt 30 31 0 16 Mar 2018
A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching Paul Swoboda Carsten Rother Hassan Abu Alhaija Dagmar Kainmüller Bogdan Savchynskyy 19 59 0 16 Dec 2016
A Message Passing Algorithm for the Minimum Cost Multicut Problem Paul Swoboda Bjoern Andres 27 26 0 16 Dec 2016
Improved Graph Clustering Yudong Chen Sujay Sanghavi Huan Xu 94 191 0 11 Oct 2012