Blossom V

swMATH4780MaRDI QIDQ16943FDOQ16943

Author name not available (Why is that?)

Described by source

• Blossom V: A new implementation of a minimum cost perfect matching algorithm

Cited In (26)

• 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
• Easy and difficult exact covering problems arising in VLSI power reduction by clock gating
• A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem
• Optimal Sokoban solving using pattern databases with specific domain knowledge
• Surface code quantum computing by lattice surgery
• Fault-tolerant quantum error correction for non-abelian anyons
• On vertex independence number of uniform hypergraphs
• Districting for Arc Routing
• Discrete Calculus
• Topological quantum error correction in the Kitaev honeycomb model
• Partitioning planar graphs: a fast combinatorial approach for max-cut
• 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
• Using well-solvable minimum cost exact covering for VLSI clock energy minimization
• Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
• 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
• A probability metrics approach for reducing the bias of optimality gap estimators in two-stage stochastic linear programming
• An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem
• 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

This page was built for software: Blossom V