Search results
From MaRDI portal
- Trees not Blossoms: A Recursive Maximum Matching Approach 2021-01-27 Paper Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar...10 bytes (15 words) - 06:16, 12 December 2023
- Schedules 1998-07-06 Paper Approximation algorithms 1998-04-03 Paper Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite...10 bytes (17 words) - 09:10, 11 December 2023
- Approximation for Maximum Weight Matroid Intersection 2018-07-16 Paper Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut 2018-07-16...10 bytes (14 words) - 09:27, 6 October 2023
- Subexponential Parameterized algorithms on disk graphs (extended abstract) 2024-07-19 Paper Subexponential parameterized algorithms for cut and cycle hitting problems...10 bytes (14 words) - 01:43, 25 September 2023
- optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals 2020-06-02 Paper Approximation algorithms for connected maximum coverage...10 bytes (17 words) - 19:44, 9 December 2023
- 2008-05-20 Paper Approximating Maximum Cut with Limited Unbalance 2008-02-21 Paper Approximation algorithms for maximum cut with limited unbalance 2007-10-18...10 bytes (13 words) - 03:03, 12 December 2023
- for parameterized and approximation algorithms for maximum internal spanning tree 2016-12-22 Paper Approximating maximum agreement forest on multiple binary...10 bytes (14 words) - 17:06, 9 December 2023
- de/entity/Q5005128 2021-08-04 Paper Massively Parallel Algorithms for Minimum Cut 2021-03-15 Paper Faster Algorithms for Edge Connectivity via Random 2-Out Contractions...10 bytes (13 words) - 11:54, 28 January 2024
- Vertices 2017-12-11 Paper On maximum leaf trees and connections to connected maximum cut problems 2017-10-18 Paper Streaming Algorithms for Estimating the Matching...10 bytes (17 words) - 22:41, 9 December 2023
- Paper Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm 2018-10-30 Paper Robust algorithms with...10 bytes (14 words) - 18:22, 6 October 2023
- 2006-08-30 Paper Algorithms – ESA 2005 2006-06-27 Paper Algorithms – ESA 2005 2006-06-27 Paper An approximation algorithm for maximum triangle packing...10 bytes (15 words) - 17:00, 9 December 2023
- Practical performance of efficient minimum cut algorithms 2000-03-19 Paper Introduction to ABACUS -- a branch-and-cut system 1998-11-15 Paper https://portal...10 bytes (15 words) - 23:05, 8 December 2023
- \(k\)-cut in randomized polynomial time 2021-02-15 Paper A tight \(\sqrt{2} \)-approximation for linear 3-cut 2020-10-21 Paper Hypergraph $k$-cut for fixed...10 bytes (13 words) - 15:52, 6 October 2023
- approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem 2015-12-11 Paper Improved Approximation Algorithms for the Maximum Happy Vertices...10 bytes (14 words) - 23:45, 10 December 2023
- 2015-12-10 Paper Algorithms solving the matching cut problem 2015-12-08 Paper A measure & conquer approach for the analysis of exact algorithms 2015-11-11 Paper...10 bytes (14 words) - 20:13, 24 September 2023
- 2009-03-04 Paper Approximating Maximum Cut with Limited Unbalance 2008-02-21 Paper Approximation algorithms for maximum cut with limited unbalance 2007-10-18...10 bytes (14 words) - 03:03, 12 December 2023
- applications to matching cut enumeration 2021-10-28 Paper Matching cut in graphs with large minimum degree 2021-04-19 Paper Matching cut: kernelization, single-exponential...10 bytes (16 words) - 19:13, 8 December 2023
- Minimum Cut Algorithms 2019-09-12 Paper Quasipolynomial Set-Based Symbolic Algorithms for Parity Games 2019-07-04 Paper A Subquadratic-Time Algorithm for Decremental...10 bytes (17 words) - 02:18, 12 December 2023
- max-flows 2023-11-14 Paper Online Algorithms for Weighted Paging with Predictions 2023-10-31 Paper Minimum Cut and Minimum k -Cut in Hypergraphs via Branching...10 bytes (13 words) - 08:30, 7 October 2023
- Publication Type A faster combinatorial algorithm for maximum bipartite matching 2024-11-28 Paper Parallel approximate maximum flows in near-linear work and polylogarithmic...10 bytes (15 words) - 15:00, 8 December 2023
