Blossom V
From MaRDI portal
Software:16943
No author found.
Related Items (26)
Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem ⋮ Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs ⋮ Fault-tolerant quantum error correction for non-abelian anyons ⋮ An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem ⋮ Districting for Arc Routing ⋮ On vertex independence number of uniform hypergraphs ⋮ Optimal Sokoban solving using pattern databases with specific domain knowledge ⋮ A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem ⋮ Partitioning planar graphs: a fast combinatorial approach for max-cut ⋮ A probability metrics approach for reducing the bias of optimality gap estimators in two-stage stochastic linear programming ⋮ A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming ⋮ Approximating the metric TSP in linear time ⋮ The role of entropy in topological quantum error correction ⋮ On optimal flip-flop grouping for VLSI power minimization ⋮ Surface code quantum computing by lattice surgery ⋮ Topological quantum error correction in the Kitaev honeycomb model ⋮ Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments ⋮ Discrete Calculus ⋮ Capacitated arc routing problem with deadheading demands ⋮ Using well-solvable minimum cost exact covering for VLSI clock energy minimization ⋮ Computing Minimum-Weight Perfect Matchings ⋮ OAR lib: an open source arc routing library ⋮ Approximation algorithms in combinatorial scientific computing ⋮ Clustering analysis of a dissimilarity: a review of algebraic and geometric representation ⋮ Easy and difficult exact covering problems arising in VLSI power reduction by clock gating ⋮ Fast algorithms for the undirected negative cost cycle detection problem
This page was built for software: Blossom V
