On the public citation graph
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
0 signed · 37 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_2openalex-snapshot
Submodular Functions, Matroids, and Certain Polyhedra
inferredcites →https://doi.org/10.1007/bf01584070openalex-snapshot
The traveling-salesman problem and minimum spanning trees: Part II
inferredcites →https://doi.org/10.1007/bf02579168openalex-snapshot
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
inferredcites →https://doi.org/10.1007/bf02591988openalex-snapshot
Two algorithms for weighted matroid intersection
inferredcites →https://doi.org/10.1016/0020-0190(75)90056-3openalex-snapshot
An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
inferredcites →https://doi.org/10.1016/0022-0000(85)90014-5openalex-snapshot
A linear-time algorithm for a special case of disjoint set union
inferredcites →https://doi.org/10.1016/0196-6774(84)90042-7openalex-snapshot
Efficient algorithms for a family of matroid intersection problems
inferredcites →https://doi.org/10.1016/0377-2217(89)90356-1openalex-snapshot
Constrained spanning trees and the traveling salesman problem
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.1287/opre.18.6.1138openalex-snapshot
The Traveling-Salesman Problem and Minimum Spanning Trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1997.0862openalex-snapshot
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
inferred← citeshttps://doi.org/10.1007/11970125_20openalex-snapshot
The k-Allocation Problem and Its Variants
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_9openalex-snapshot
A network-flow technique for finding low-weight bounded-degree spanning trees
inferred← citeshttps://doi.org/10.1007/978-1-4614-5134-1_25openalex-snapshot
An Approximation Algorithm for the Three Depots Hamiltonian Path Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_8openalex-snapshot
Auswahl von theoriebezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/bf01586055openalex-snapshot
Crashing a maximum-weight complementary basis
inferred← citeshttps://doi.org/10.1007/s00236-010-0120-9openalex-snapshot
How to allocate review tasks for robust ranking
inferred← citeshttps://doi.org/10.1007/s11590-010-0252-4openalex-snapshot
Approximation algorithms for multiple terminal, Hamiltonian path problems
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00031-8openalex-snapshot
Matroid optimization with generalized constraints
inferred← citeshttps://doi.org/10.1016/0167-6377(91)90061-sopenalex-snapshot
Color constrained combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/0377-2217(89)90356-1openalex-snapshot
Constrained spanning trees and the traveling salesman problem
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50013-0openalex-snapshot
10.1016/b978-044488002-4/50013-0
inferred← citeshttps://doi.org/10.1016/j.dam.2014.08.034openalex-snapshot
On the generality of the greedy algorithm for solving matroid base problems
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.11.009openalex-snapshot
The k -path tree matroid and its applications to survivable network design
inferred← citeshttps://doi.org/10.1016/j.disopt.2010.08.001openalex-snapshot
The minimum spanning tree problem with conflict constraints and its variations
inferred← citeshttps://doi.org/10.1016/j.orl.2009.10.001openalex-snapshot
–approximation algorithm for two variants of a 2-depot Hamiltonian path problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.08.023openalex-snapshot
The structural complexity landscape of finding balance-fair shortest paths
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115486openalex-snapshot
Arborescences and shortest path trees when colors matter
inferred← citeshttps://doi.org/10.1080/02331934.2022.2044479openalex-snapshot
Biobjective optimization problems on matroids with binary costs
inferred← citeshttps://doi.org/10.1109/focs.2006.48openalex-snapshot
Minimum Bounded Degree Spanning Trees
inferred← citeshttps://doi.org/10.1137/0218008openalex-snapshot
Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
inferred← citeshttps://doi.org/10.1137/16m1106717openalex-snapshot
Making Bipartite Graphs DM-Irreducible
inferred← citeshttps://doi.org/10.1137/s0097539703426775openalex-snapshot
An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
inferred← citeshttps://doi.org/10.1137/s0097539795295468openalex-snapshot
Approximating Capacitated Routing and Delivery Problems
inferred← citeshttps://doi.org/10.2139/ssrn.5249772openalex-snapshot
Approximation and Fpt Algorithms for Finding Dm-Irreducible Spanning Subgraphs
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.