On the public citation graph
New scaling algorithms for the assignment and minimum mean cycle problems
0 signed · 118 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01589405openalex-snapshot
Dual coordinate step methods for linear network flow problems
inferredcites →https://doi.org/10.1007/bf01840350openalex-snapshot
A linear time randomizing algorithm for searching ranked functions
inferredcites →https://doi.org/10.1007/bf02186476openalex-snapshot
The auction algorithm: A distributed relaxation method for the assignment problem
inferredcites →https://doi.org/10.1007/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
inferredcites →https://doi.org/10.1016/0012-365x(78)90011-0openalex-snapshot
A characterization of the minimum cycle mean in a digraph
inferredcites →https://doi.org/10.1016/0166-218x(81)90026-3openalex-snapshot
Parametric shortest path algorithms with an application to cyclic staffing
inferredcites →https://doi.org/10.1016/0305-0548(83)90030-8openalex-snapshot
Routing and scheduling of vehicles and crews
inferredcites →https://doi.org/10.1109/sfcs.1984.715934openalex-snapshot
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0204043openalex-snapshot
Network Flow and Testing Graph Connectivity
inferredcites →https://doi.org/10.1145/28395.28397openalex-snapshot
Solving minimum-cost flow problems by successive approximation
inferredcites →https://doi.org/10.1145/363269.363610openalex-snapshot
Algorithm 360: shortest-path forest with topological ordering [H]
inferredcites →https://doi.org/10.1145/62212.62250openalex-snapshot
Finding minimum-cost circulations by canceling negative cycles
inferredcites →https://doi.org/10.1145/62212.62263openalex-snapshot
Almost-optimum speed-ups of algorithms for bipartite matching and related problems
inferredcites →https://doi.org/10.1145/800076.802475openalex-snapshot
The complexity of dynamic languages and dynamic optimization problems
inferredcites →https://doi.org/10.1287/moor.2.3.209openalex-snapshot
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.10048openalex-snapshot
Combinatorial algorithms for inverse network flow problems
inferred← citeshttps://doi.org/10.1002/net.21914openalex-snapshot
A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems
inferred← citeshttps://doi.org/10.1002/net.22097openalex-snapshot
On maximum ratio clique relaxations
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_144openalex-snapshot
Bilevel fractional programming; Combinatorial matrix analysis; Combinatorial optimization algorithms in resource allocation problem; Combinatorial optimization games; Complexity classes in optimization; Complexity of degeneracy; Complexity of gradients, Jacobians, and Hessians; Complexity theory;…
inferred← citeshttps://doi.org/10.1007/11427186_41openalex-snapshot
Fast Algorithms for Weighted Bipartite Matching
inferred← citeshttps://doi.org/10.1007/11785293_33openalex-snapshot
Approximating Rational Objectives Is as Easy as Approximating Linear Ones
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_140openalex-snapshot
Interval graphs with side (and size) constraints
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_81openalex-snapshot
Tree contractions and evolutionary trees
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_188openalex-snapshot
Fractional Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_62openalex-snapshot
Fractional Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_6openalex-snapshot
Fractional Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_2openalex-snapshot
Linear Assignment Problems and Extensions
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_188-1openalex-snapshot
Fractional Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-44668-9_7openalex-snapshot
List of Optimal Solutions of the Minimum Cost for Minimum Time Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-81396-2_14openalex-snapshot
Approximate Min-Sum Subset Convolution
inferred← citeshttps://doi.org/10.1007/978-3-319-21690-4_9openalex-snapshot
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_25openalex-snapshot
Finding k-Connected Subgraphs with Minimum Average Weight
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_5openalex-snapshot
Approximate Labelled Subtree Homeomorphism
inferred← citeshttps://doi.org/10.1007/978-3-642-33122-0_11openalex-snapshot
RNA Tree Comparisons via Unrooted Unordered Alignments
inferred← citeshttps://doi.org/10.1007/bf01940880openalex-snapshot
Algorithms for Dense Graphs and Networks on the Random Access Computer
inferred← citeshttps://doi.org/10.1007/s00453-015-9994-9openalex-snapshot
Fair Matchings and Related Problems
inferred← citeshttps://doi.org/10.1007/s10107-010-0364-8openalex-snapshot
Approximating a class of combinatorial problems with rational objective function
inferred← citeshttps://doi.org/10.1007/s10287-013-0197-zopenalex-snapshot
The maximum ratio clique problem
inferred← citeshttps://doi.org/10.1007/s10703-021-00373-5openalex-snapshot
Faster algorithms for quantitative verification in bounded treewidth graphs
inferred← citeshttps://doi.org/10.1007/s10852-005-9009-yopenalex-snapshot
The Container Transshipment Problem: Searching Representation Landscapes with Metaheuristic Algorithms
inferred← citeshttps://doi.org/10.1007/s10898-016-0487-4openalex-snapshot
Fractional 0–1 programming: applications and algorithms
inferred← citeshttps://doi.org/10.1007/s10951-011-0230-4openalex-snapshot
Vyacheslav Tanaev: contributions to scheduling and related areas
inferred← citeshttps://doi.org/10.1007/s11036-017-0858-1openalex-snapshot
Optimizing Detection Quality and Transmission Quality of Barrier Coverage in Heterogeneous Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/s11590-021-01791-4openalex-snapshot
The assignment problem revisited
inferred← citeshttps://doi.org/10.1016/0166-218x(92)00188-ropenalex-snapshot
Computing maximum mean cuts
inferred← citeshttps://doi.org/10.1016/0166-218x(93)00094-gopenalex-snapshot
An algorithm for fractional assignment problems
inferred← citeshttps://doi.org/10.1016/0167-6377(93)90022-9openalex-snapshot
Approximate binary search algorithms for mean cuts and cycles
inferred← citeshttps://doi.org/10.1016/0167-6377(95)00047-xopenalex-snapshot
A dual approximation approach to weighted matroid intersection
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00188-3openalex-snapshot
The complexity of mean payoff games on graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2017.08.004openalex-snapshot
Solving MIPs via scaling-based augmentation
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.03.023openalex-snapshot
Scheduling unit-length jobs with machine eligibility restrictions
inferred← citeshttps://doi.org/10.1016/j.ins.2006.05.004openalex-snapshot
Incremental assignment problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.08.010openalex-snapshot
A simple reduction from maximum weight matching to maximum cardinality matching
inferred← citeshttps://doi.org/10.1016/j.jda.2007.04.002openalex-snapshot
Computing the throughput of Concatenation State Machines
inferred← citeshttps://doi.org/10.1016/j.jda.2007.07.001openalex-snapshot
Approximate labelled subtree homeomorphism
inferred← citeshttps://doi.org/10.1016/j.jpdc.2024.104838openalex-snapshot
HyLAC: Hybrid linear assignment solver in CUDA
inferred← citeshttps://doi.org/10.1016/j.orl.2026.107536openalex-snapshot
A note on the low-rank assignment problem
inferred← citeshttps://doi.org/10.1016/j.rico.2024.100383openalex-snapshot
New auction algorithms for the assignment problem and extensions
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.03.042openalex-snapshot
An O(m(m+nlogn)log(nC)) -time algorithm to solve the minimum cost tension problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.031openalex-snapshot
Approximating the minimum cycle mean
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00115-xopenalex-snapshot
An approximate binary search algorithm for the multiple-choice knapsack problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00011-xopenalex-snapshot
A cost-scaling algorithm for 0–1 submodular flows
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00172-9openalex-snapshot
Algorithms and codes for dense assignment problems: the state of the art
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00208-3openalex-snapshot
Satisfiability problems on intervals and unit intervals
inferred← citeshttps://doi.org/10.1016/s0305-0548(97)00019-1openalex-snapshot
A new algorithm for the assignment problem: An alternative to the Hungarian method
inferred← citeshttps://doi.org/10.1080/02331939508844049openalex-snapshot
A comprehensive simplex-like algorithm for network optimization and perturbation analysis
inferred← citeshttps://doi.org/10.1089/cmb.2016.0204openalex-snapshot
Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions
inferred← citeshttps://doi.org/10.1089/cmb.2022.0090openalex-snapshot
Generalization of Phylogenetic Matching Metrics with Experimental Tests of Practical Advantages
inferred← citeshttps://doi.org/10.1109/43.728912openalex-snapshot
Faster maximum and minimum mean cycle algorithms for system-performance analysis
inferred← citeshttps://doi.org/10.1109/71.862206openalex-snapshot
A parallel pruning technique for highly asymmetric assignment problems
inferred← citeshttps://doi.org/10.1109/ccdc.2016.7531871openalex-snapshot
Zero element row augmenting path algorithm for linear assignment problems
inferred← citeshttps://doi.org/10.1109/cvpr.2016.135openalex-snapshot
Pairwise Matching through Max-Weight Bipartite Belief Propagation
inferred← citeshttps://doi.org/10.1109/cvpr52734.2025.02030openalex-snapshot
Higher-Order Ratio Cycles for Fast and Globally Optimal Shape Matching
inferred← citeshttps://doi.org/10.1109/dac.1999.781227openalex-snapshot
Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems
inferred← citeshttps://doi.org/10.1109/focs.2012.9openalex-snapshot
A Weight-Scaling Algorithm for Min-Cost Imperfect Matchings in Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00038openalex-snapshot
Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!
inferred← citeshttps://doi.org/10.1109/icassp49660.2025.10889798openalex-snapshot
Learning Permutations in Monarch Factorization
inferred← citeshttps://doi.org/10.1109/infcom.2000.832562openalex-snapshot
Scheduling algorithms for input-queued switches: randomized techniques and experimental evaluation
inferred← citeshttps://doi.org/10.1109/tcbb.2011.48openalex-snapshot
Matching Split Distance for Unrooted Binary Phylogenetic Trees
inferred← citeshttps://doi.org/10.1109/tcyb.2014.2309632openalex-snapshot
Optimal Object Association in the Dempster–Shafer Framework
inferred← citeshttps://doi.org/10.1109/tgrs.2014.2360097openalex-snapshot
Change Detection in Constellations of Buried Objects Extracted From Ground-Penetrating Radar Data
inferred← citeshttps://doi.org/10.1137/1.9781611974782.122openalex-snapshot
An O(nm) time algorithm for finding the min length directed cycle in a graph
inferred← citeshttps://doi.org/10.1137/1.9781611976465.16openalex-snapshot
Directed Shortest Paths via Approximate Cost Balancing
inferred← citeshttps://doi.org/10.1137/21m1439390openalex-snapshot
Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory
inferred← citeshttps://doi.org/10.1137/s0097539794263695openalex-snapshot
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
inferred← citeshttps://doi.org/10.1137/s0097539795283504openalex-snapshot
Tree Contractions and Evolutionary Trees
inferred← citeshttps://doi.org/10.1137/s0895480195280009openalex-snapshot
Valuated Matroid Intersection II: Algorithms
inferred← citeshttps://doi.org/10.1137/s0895480196306373openalex-snapshot
Realizing Interval Graphs with Size and Distance Constraints
inferred← citeshttps://doi.org/10.1145/1027084.1027085openalex-snapshot
Experimental analysis of the fastest optimum cycle ratio and mean algorithms
inferred← citeshttps://doi.org/10.1145/2529989openalex-snapshot
Linear-Time Approximation for Maximum Weight Matching
inferred← citeshttps://doi.org/10.1145/309847.309862openalex-snapshot
Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems
inferred← citeshttps://doi.org/10.1145/3155301openalex-snapshot
Scaling Algorithms for Weighted Matching in General Graphs
inferred← citeshttps://doi.org/10.1145/3313276.3316373openalex-snapshot
Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max
inferred← citeshttps://doi.org/10.1145/3696668openalex-snapshot
Maximum Cardinality f -Matching in Time O ( n 2/3 m )
inferred← citeshttps://doi.org/10.1186/1748-7188-8-13openalex-snapshot
Unrooted unordered homeomorphic subtree alignment of RNA trees
inferred← citeshttps://doi.org/10.1287/moor.25.1.76.15208openalex-snapshot
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow
inferred← citeshttps://doi.org/10.1287/moor.27.4.681.305openalex-snapshot
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
inferred← citeshttps://doi.org/10.1504/ijahuc.2015.071661openalex-snapshot
Optimising sink-connected barrier coverage in wireless sensor networks
inferred← citeshttps://doi.org/10.15807/jorsj.38.124openalex-snapshot
AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT PROBLEM
inferred← citeshttps://doi.org/10.15807/torsj.53.1openalex-snapshot
A MAXIMUM DENSITY SUBSET PROBLEM AND ITS ALGORITHM WITH APPROXIMATE BINARY SEARCH
inferred← citeshttps://doi.org/10.21203/rs.3.rs-19322/v1openalex-snapshot
An O(n^3) time algorithm for the maximum weight b-matching problem on bipartite graphs
inferred← citeshttps://doi.org/10.21203/rs.3.rs-21467/v1openalex-snapshot
An O(n3) time algorithm for the maximum weight b-matching problem on bipartite graphs
inferred← citeshttps://doi.org/10.2478/amcs-2013-0050openalex-snapshot
On a matching distance between rooted phylogenetic trees
inferred← citeshttps://doi.org/10.4137/ebo.s9657openalex-snapshot
TreeCmp: Comparison of Trees in Polynomial Time
inferred← citeshttps://doi.org/10.4204/eptcs.119.13openalex-snapshot
Approximating the minimum cycle mean
inferred← citeshttps://doi.org/10.48550/arxiv.1112.0790openalex-snapshot
Scaling algorithms for approximate and exact maximum weight matching
inferred← citeshttps://doi.org/10.48550/arxiv.2101.07155openalex-snapshot
Revisiting the Auction Algorithm for Weighted Bipartite Perfect Matchings
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0101030openalex-snapshot
Tree Contractions and Evolutionary Trees
inferred← citeshttps://doi.org/10.70675/a6de6584z939ez4d6bzbb9dzf571c8807c13openalex-snapshot
Fusion distribuée de données échangées dans un réseau de véhicules
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.