On the public citation graph
Tight integral duality gap in the Chinese Postman problem
0 signed · 31 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/3-540-36478-1_3openalex-snapshot
Matching: A Well-Solved Class of Integer Linear Programs
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf01580113openalex-snapshot
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1007/bf01581198openalex-snapshot
Tight integral duality gap in the Chinese Postman problem
inferredcites →https://doi.org/10.1007/bf01902352openalex-snapshot
2-Matchings and 2-covers of hypergraphs
inferredcites →https://doi.org/10.1007/bfb0121194openalex-snapshot
A primal algorithm for optimum matching
inferredcites →https://doi.org/10.1016/0095-8956(77)90031-4openalex-snapshot
The matroids with the max-flow min-cut property
inferredcites →https://doi.org/10.1016/0095-8956(90)90062-5openalex-snapshot
Undirected distances and the postman-structure of graphs
inferredcites →https://doi.org/10.1016/s0195-6698(81)80033-9openalex-snapshot
Matroids and Multicommodity Flows
inferredcites →https://doi.org/10.1112/plms/s3-42.1.178openalex-snapshot
On Odd Cuts and Plane Multicommodity Flows
inferredcites →https://doi.org/10.1137/0205048openalex-snapshot
On the Complexity of Timetable and Multicommodity Flow Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jctb.1994.1051openalex-snapshot
Two-Trees Optimal T-Join and Integral Packing of T-Cuts
inferred← citeshttps://doi.org/10.1006/jctb.2000.1972openalex-snapshot
Vertex Set Partitions Preserving Conservativeness
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_71openalex-snapshot
Integer multicommodity flows with reduced demands
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6openalex-snapshot
Integer Programming and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6_12openalex-snapshot
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation
inferred← citeshttps://doi.org/10.1007/bf01585937openalex-snapshot
A note on packing paths in planar graphs
inferred← citeshttps://doi.org/10.1007/bf02523685openalex-snapshot
Primal-dual approximation algorithms for integral flow and multicut in trees
inferred← citeshttps://doi.org/10.1007/s10107-021-01700-8openalex-snapshot
Integer plane multiflow maximisation: one-quarter-approximation and gaps
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00006-5openalex-snapshot
On the integral 4-packing of T-cuts
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90153-fopenalex-snapshot
A fast algorithm for maximum integral two-commodity flow in planar graphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50003-8openalex-snapshot
10.1016/b978-044488002-4/50003-8
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00133-xopenalex-snapshot
On complexity, representation and approximation of integral multicommodity flows
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80109-4openalex-snapshot
Chapter 5 Arc routing methods and applications
inferred← citeshttps://doi.org/10.1137/20m1319401openalex-snapshot
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1137/s0097539790186704openalex-snapshot
Potentials in Undirected Graphs and Planar Multiflows
inferred← citeshttps://doi.org/10.1287/moor.1030.0070openalex-snapshot
On Metric Generators of Graphs
showing the first 19 of 20 · page through all 20
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.