Blossom V: A new implementation of a minimum cost perfect matching algorithm
From MaRDI portal
(Redirected from Publication:734352)
Recommendations
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 432790 (Why is no real title available?)
- scientific article; zbMATH DE number 177565 (Why is no real title available?)
- scientific article; zbMATH DE number 487935 (Why is no real title available?)
- scientific article; zbMATH DE number 515943 (Why is no real title available?)
- scientific article; zbMATH DE number 1182765 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- An O(EV\log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs
- An analysis of alternative strategies for implementing matching algorithms
- Computing Minimum-Weight Perfect Matchings
- Maximum matching and a polyhedron with 0,1-vertices
- Network flows. Theory, algorithms, and applications.
- On the use of optimal fractional matchings for solving the (integer) matching problem
- Paths, Trees, and Flowers
- Recursive Star-Tree Parallel Data Structure
- Solving (large scale) matching problems combinatorially
- The pairing heap: A new form of self-adjusting heap
Cited in
(43)- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
- Fast algorithms for the undirected negative cost cycle detection problem
- OAR lib: an open source arc routing library
- Data Reduction for Maximum Matching on Real-World Graphs
- Implementation of O ( nm log n ) weighted matchings in general graphs
- Easy and difficult exact covering problems arising in VLSI power reduction by clock gating
- Optimal Sokoban solving using pattern databases with specific domain knowledge
- On vertex independence number of uniform hypergraphs
- Fault-tolerant quantum error correction for non-abelian anyons
- Surface code quantum computing by lattice surgery
- An algorithm for flexible transshipments with perfect synchronization
- Logical error rate scaling of the toric code
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- Topological quantum error correction in the Kitaev honeycomb model
- Fast decoders for qudit topological codes
- scientific article; zbMATH DE number 515943 (Why is no real title available?)
- The role of entropy in topological quantum error correction
- Approximation algorithms in combinatorial scientific computing
- Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
- On matchings, T‐joins, and arc routing in road networks
- Blossom V
- Using well-solvable minimum cost exact covering for VLSI clock energy minimization
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
- Block designs that provide optimal power in the Cochran-Mantel-Haenszel test
- Improved algorithms and novel applications of the FrankWolfe.jl library
- Revisiting a cutting-plane method for perfect matchings
- Implementation of magic state injection within heavy-hexagon architectures
- A Hybrid Approach to Fast Indirect Quadrilateral Mesh Generation
- Learning time-dependent noise to reduce logical errors: real time error rate estimation in quantum error correction
- Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
- On optimal flip-flop grouping for VLSI power minimization
- Approximating the metric TSP in linear time
- Integer Programming and Combinatorial Optimization
- A hybrid architecture decoder integrating Kolmogorov-Arnold network and transformer for decoding rotating surface codes
- Improving a constructive heuristic for the general routing problem
- A magic state’s fidelity can be superior to the operations that created it
- A probability metrics approach for reducing the bias of optimality gap estimators in two-stage stochastic linear programming
- Computing in combinatorial optimization
- A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming
- Computing Minimum-Weight Perfect Matchings
- Capacitated arc routing problem with deadheading demands
- A branch-and-price algorithm for solving the Hamiltonian p-median problem
- Districting for arc routing
This page was built for publication: Blossom V: A new implementation of a minimum cost perfect matching algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734352)
