Blossom V

From MaRDI portal
Software:16943



swMATH4780MaRDI QIDQ16943


No author found.





Related Items (26)

Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problemComputational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphsFault-tolerant quantum error correction for non-abelian anyonsAn experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problemDistricting for Arc RoutingOn vertex independence number of uniform hypergraphsOptimal Sokoban solving using pattern databases with specific domain knowledgeA Branch-and-Price Algorithm for Solving the Hamiltonian p-Median ProblemPartitioning planar graphs: a fast combinatorial approach for max-cutA probability metrics approach for reducing the bias of optimality gap estimators in two-stage stochastic linear programmingA detailed introduction to a minimum-cost perfect matching algorithm based on linear programmingApproximating the metric TSP in linear timeThe role of entropy in topological quantum error correctionOn optimal flip-flop grouping for VLSI power minimizationSurface code quantum computing by lattice surgeryTopological quantum error correction in the Kitaev honeycomb modelData Reduction for Maximum Matching on Real-World Graphs: Theory and ExperimentsDiscrete CalculusCapacitated arc routing problem with deadheading demandsUsing well-solvable minimum cost exact covering for VLSI clock energy minimizationComputing Minimum-Weight Perfect MatchingsOAR lib: an open source arc routing libraryApproximation algorithms in combinatorial scientific computingClustering analysis of a dissimilarity: a review of algebraic and geometric representationEasy and difficult exact covering problems arising in VLSI power reduction by clock gatingFast algorithms for the undirected negative cost cycle detection problem


This page was built for software: Blossom V