On the public citation graph

An application of simultaneous approximation in combinatorial optimization

0 signed · 29 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
inferredcites →https://doi.org/10.1007/bf02592074openalex-snapshot
Packing and covering with integral feasible flows in integral supply-demand networks
inferredcites →https://doi.org/10.1016/0095-8956(84)90023-6openalex-snapshot
Testing membership in matroid polyhedra
inferredcites →https://doi.org/10.1016/0166-218x(82)90053-1openalex-snapshot
Minimization on submodular flows
inferredcites →https://doi.org/10.1016/s0167-5060(08)70734-9openalex-snapshot
A Min-Max Relation for Submodular Functions on Graphs
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1287/moor.10.2.251openalex-snapshot
A Primal-Dual Algorithm for Submodular Flows
inferredcites →https://doi.org/10.1287/opre.34.2.250openalex-snapshot
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
inferredcites →https://doi.org/10.6028/jres.069b.004openalex-snapshot
Minimum partition of a matroid into independent subsets

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jcss.1997.1472openalex-snapshot
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
inferred← citeshttps://doi.org/10.1007/3-540-46521-9_22openalex-snapshot
Approximating SVP ∞ to within Almost-Polynomial Factors Is NP-Hard
inferred← citeshttps://doi.org/10.1007/bfb0035777openalex-snapshot
The complexity of nonlinear separable optimization
inferred← citeshttps://doi.org/10.1016/0167-6377(87)90036-8openalex-snapshot
Strongly polynomial algorithm for a class of combinatorial LCPs
inferred← citeshttps://doi.org/10.1016/0167-6377(89)90049-7openalex-snapshot
On simultaneous approximation in quadratic integer programming
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90064-8openalex-snapshot
A hierarchy of polynomial time lattice basis reduction algorithms
inferred← citeshttps://doi.org/10.1016/0895-7177(96)00128-8openalex-snapshot
A simplex algorithm for a class of leontief flow problems
inferred← citeshttps://doi.org/10.1016/b978-0-12-545075-1.50016-xopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70131-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00290-0openalex-snapshot
Approximating SVP∞ to within almost-polynomial factors is NP-hard
inferred← citeshttps://doi.org/10.1017/ccol0521340446.006openalex-snapshot
On the complexity of linear programming
inferred← citeshttps://doi.org/10.1109/focs.2011.31openalex-snapshot
Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366815openalex-snapshot
The hardness of approximate optima in lattices, codes, and systems of linear equations
inferred← citeshttps://doi.org/10.1145/201019.201036openalex-snapshot
Las Vegas algorithms for linear and integer programming when the dimension is small
inferred← citeshttps://doi.org/10.1145/96559.96597openalex-snapshot
Convex separable optimization is not much harder than linear optimization
inferred← citeshttps://doi.org/10.1287/moor.14.1.60openalex-snapshot
A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems
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.