Pages that link to "Item:Q734352"

The following pages link to Blossom V: A new implementation of a minimum cost perfect matching algorithm (Q734352):

Displaying 30 items.

• Blossom V (Q16943) (← links)
• Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
• Approximating the metric TSP in linear time (Q649110) (← links)
• Clustering analysis of a dissimilarity: a review of algebraic and geometric representation (Q779022) (← links)
• Optimal Sokoban solving using pattern databases with specific domain knowledge (Q899157) (← links)
• Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs (Q1652405) (← links)
• Capacitated arc routing problem with deadheading demands (Q1761173) (← links)
• Using well-solvable minimum cost exact covering for VLSI clock energy minimization (Q1785247) (← links)
• Computing in combinatorial optimization (Q2075761) (← links)
• Revisiting a cutting-plane method for perfect matchings (Q2165581) (← links)
• OAR lib: an open source arc routing library (Q2293658) (← links)
• Easy and difficult exact covering problems arising in VLSI power reduction by clock gating (Q2339838) (← links)
• Fault-tolerant quantum error correction for non-abelian anyons (Q2408061) (← links)
• An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem (Q2408163) (← links)
• A probability metrics approach for reducing the bias of optimality gap estimators in two-stage stochastic linear programming (Q2434991) (← links)
• On optimal flip-flop grouping for VLSI power minimization (Q2450696) (← links)
• A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming (Q2696937) (← links)
• Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem (Q2903995) (← links)
• Districting for Arc Routing (Q2940070) (← links)
• A Branch-and-Price Algorithm for Solving the Hamiltonian <i>p</i>-Median Problem (Q2960363) (← links)
• Topological quantum error correction in the Kitaev honeycomb model (Q3303154) (← links)
• Logical error rate scaling of the toric code (Q3386980) (← links)
• A magic state’s fidelity can be superior to the operations that created it (Q3387643) (← links)
• Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments (Q5009617) (← links)
• The role of entropy in topological quantum error correction (Q5132101) (← links)
• On matchings, <i>T</i>‐joins, and arc routing in road networks (Q6065851) (← links)
• Improving a constructive heuristic for the general routing problem (Q6179705) (← links)
• Learning time-dependent noise to reduce logical errors: real time error rate estimation in quantum error correction (Q6204467) (← links)