On the public citation graph

Optima of dual integer linear programs

0 signed · 26 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/bf02579271openalex-snapshot
Maximum degree and fractional matchings in uniform hypergraphs
inferredcites →https://doi.org/10.1016/0012-365x(75)90058-8openalex-snapshot
On the ratio of optimal integral and fractional covers
inferredcites →https://doi.org/10.1016/0095-8956(80)90075-1openalex-snapshot
Decomposition of regular matroids
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.4153/cjm-1965-053-6openalex-snapshot
Maxima for Graphs and a New Proof of a Theorem of Turán

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11549345_53openalex-snapshot
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_74openalex-snapshot
The Communication Complexity of Approximate Set Packing and Covering
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_159openalex-snapshot
Improved parallel approximation of a class of integer programming problems
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_12openalex-snapshot
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_1openalex-snapshot
Identically Self-blocking Clutters
inferred← citeshttps://doi.org/10.1007/978-94-009-1606-7_11openalex-snapshot
An Integer Linear Programming Algorithm Polynomial in the Average Case
inferred← citeshttps://doi.org/10.1007/bf01098364openalex-snapshot
The maximum clique problem
inferred← citeshttps://doi.org/10.1007/bf02523683openalex-snapshot
Improved parallel approximation of a class of integer programming problems
inferred← citeshttps://doi.org/10.1007/s00454-008-9128-0openalex-snapshot
Linear Programming Bounds for Codes via a Covering Argument
inferred← citeshttps://doi.org/10.1007/s10107-002-0370-6openalex-snapshot
Approximating disjoint-path problems using packing integer programs
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00127-2openalex-snapshot
On the number of nearly perfect matchings in almost regular uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/s0924-6509(08)70105-3openalex-snapshot
WITHDRAWN: References
inferred← citeshttps://doi.org/10.1023/a:1012778715468openalex-snapshot
Combinatorial Problems of Packing and Covering and Related Problems of Integer Linear Programming
inferred← citeshttps://doi.org/10.1137/s0097539796314240openalex-snapshot
Improved Approximation Guarantees for Packing and Covering Integer Programs
inferred← citeshttps://doi.org/10.1145/225058.225138openalex-snapshot
Improved approximations of packing and covering problems
inferred← citeshttps://doi.org/10.1145/3033274.3085121openalex-snapshot
Combinatorial Auctions Do Need Modest Interaction
inferred← citeshttps://doi.org/10.1145/3381521openalex-snapshot
Combinatorial Auctions Do Need Modest Interaction
inferred← citeshttps://doi.org/10.1349/ddlp.2780openalex-snapshot
Exact and approximation algorithms for network flow and disjoint-path problems.
inferred← citeshttps://doi.org/10.4213/dm316openalex-snapshot
Аппроксимация оптимумов целочисленных программ типа покрытия - упаковки
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.