Cited in
(37)- 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
- 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
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- Topological quantum error correction in the Kitaev honeycomb model
- 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
- VRPH
- VLSI
- PBGL
- Blossom IV
- JUNG
- Matchbox
- BUbiNG
- ArcRoutingLibrary
- Trove
- FrankWolfe.jl
- Using well-solvable minimum cost exact covering for VLSI clock energy minimization
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
- PyMatching
- 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
- Discrete calculus. Applied analysis on graphs for computational science
- A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming
- Computing Minimum-Weight Perfect Matchings
- XZZX
- 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 software: Blossom V
