Pith. sign in

REVIEW 3 cited by

Efficient implementations of minimum-cost flow algorithms

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1207.6381 v1 pith:R55UWJDR submitted 2012-07-26 cs.DM cs.DS

Z. Király , P. Kovács This is my paper · ORCID
classification cs.DMcs.DS
keywords efficientimplementationscost-scalingflowminimum-costalgorithmalgorithmscodes
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper presents efficient implementations of several algorithms for solving the minimum-cost network flow problem. Various practical heuristics and other important implementation aspects are also discussed. A novel result of this work is the application of Goldberg's recent partial augment-relabel method in the cost-scaling algorithm. The presented implementations are available as part of the LEMON open source C++ optimization library (\url{http://lemon.cs.elte.hu/}). The performance of these codes is compared to well-known and efficient minimum-cost flow solvers, namely CS2, RelaxIV, MCF, and the corresponding method of the LEDA library. According to thorough experimental analysis, the presented cost-scaling and network simplex implementations turned out to be more efficient than LEDA and MCF. Furthermore, the cost-scaling implementation is competitive with CS2. The RelaxIV algorithm is often much slower than the other codes, although it is quite efficient on particular problem instances.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bayesian In Vivo Tracking of Synapses using Joint Poisson Deconvolution and Diffeomorphic Registration

    cs.CV 2026-05 unverdicted novelty 7.0 of 10

    A unified Bayesian model performs joint Poisson deconvolution and diffeomorphic registration to construct probabilistic synapse templates, denoise data, infer intensities, correct tissue motion, and provide confidence...

  2. Automata Learning -- Expect Delays!

    cs.FL 2025-08 conditional novelty 7.0 of 10

    A two-stage active learning method for Mealy machines with stochastic transition delays uses learned structure to plan efficient delay sampling, outperforming naive sampling-based L*.

  3. Computing and Learning on Combinatorial Data

    cs.AI 2025-02 conditional novelty 4.0 of 10

    A dissertation compiling five prior papers: GPU-accelerated persistent homology (HYPHA, Ripser++), near-linear-time approximated Wasserstein distance for persistence diagrams (PDoptFlow), and topology-based graph and ...

Pith tools