On the public citation graph

Two algorithms for weighted matroid intersection

https://doi.org/10.1007/bf02591988

0 signed · 48 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/3-540-36478-1_2openalex-snapshot

Submodular Functions, Matroids, and Certain Polyhedra

inferredcites →https://doi.org/10.1016/0196-6774(81)90032-8openalex-snapshot

A weighted matroid intersection algorithm

inferredcites →https://doi.org/10.1016/s0167-5060(08)70817-3openalex-snapshot

Matroid Intersection

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.15807/jorsj.19.32openalex-snapshot

AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"

inferredcites →https://doi.org/10.15807/jorsj.20.1openalex-snapshot

A PRIMAL APPROACH TO THE INDEPENDENT ASSIGNMENT PROBLEM

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118627372.refsopenalex-snapshot

References

inferred← citeshttps://doi.org/10.1007/11604686_23openalex-snapshot

Optimal Hypergraph Tree-Realization

inferred← citeshttps://doi.org/10.1007/11970125_20openalex-snapshot

The k-Allocation Problem and Its Variants

inferred← citeshttps://doi.org/10.1007/3-540-36478-1_7openalex-snapshot

Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection

inferred← citeshttps://doi.org/10.1007/bf01586055openalex-snapshot

Crashing a maximum-weight complementary basis

inferred← citeshttps://doi.org/10.1007/bf01589417openalex-snapshot

A matroid algorithm and its application to the efficient solution of two optimization problems on graphs

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/s10107-018-1260-xopenalex-snapshot

Exact and Approximation Algorithms for Weighted Matroid Intersection

inferred← citeshttps://doi.org/10.1016/0166-218x(92)90113-oopenalex-snapshot

Paroids: a canonical format for combinatorial optimization

inferred← citeshttps://doi.org/10.1016/0166-218x(93)90005-9openalex-snapshot

Paroid search: generic local combinatorial optimization

inferred← citeshttps://doi.org/10.1016/0167-6377(91)90061-sopenalex-snapshot

Color constrained combinatorial optimization problems

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/0196-6774(92)90018-8openalex-snapshot

Random pseudo-polynomial algorithms for exact matroid problems

inferred← citeshttps://doi.org/10.1016/0377-2217(95)00008-eopenalex-snapshot

A bound for the symmetric travelling salesman problem through matroid formulation

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.dam.2020.02.005openalex-snapshot

The b -branching problem in digraphs

inferred← citeshttps://doi.org/10.1016/j.dam.2022.07.017openalex-snapshot

Multi-objective matroid optimization with ordinal weights

inferred← citeshttps://doi.org/10.1016/j.dam.2025.04.001openalex-snapshot

Finding spanning trees with perfect matchings

inferred← citeshttps://doi.org/10.1016/j.dam.2026.07.027openalex-snapshot

Optimization of the directed spanning trees using the weighted matroid intersection algorithm

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.tcs.2015.05.012openalex-snapshot

On finding optimal polytrees

inferred← citeshttps://doi.org/10.1109/31.41315openalex-snapshot

Algorithmic remarks on the Nishi-Chua uniqueness criterion for electrical networks containing controlled sources

inferred← citeshttps://doi.org/10.1109/43.662671openalex-snapshot

Efficient approximation of symbolic network functions using matroid intersection algorithms

inferred← citeshttps://doi.org/10.1109/cdc.2006.377732openalex-snapshot

Lower and Upper Bounds for a Multiple Depot UAV Routing Problem

inferred← citeshttps://doi.org/10.1109/focs.2015.68openalex-snapshot

A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization

inferred← citeshttps://doi.org/10.1109/focs.2019.00072openalex-snapshot

Faster Matroid Intersection

inferred← citeshttps://doi.org/10.1109/iscas.1995.523836openalex-snapshot

Efficient approximation of symbolic network functions using matroid intersection algorithms

inferred← citeshttps://doi.org/10.1109/iscas.1997.621491openalex-snapshot

Comparison of matroid intersection algorithms for large circuit analysis

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/0402002openalex-snapshot

Intersection of Two Matroids: (Condensed) Border Graphs and Ranking

inferred← citeshttps://doi.org/10.1137/22m152579xopenalex-snapshot

Matroid Intersection under Restricted Oracles

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.1137/s0895479896311438openalex-snapshot

On the Degree of Mixed Polynomial Matrices

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/jorsj.56.15openalex-snapshot

MATROID INTERSECTION WITH PRIORITY CONSTRAINTS

inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8217openalex-snapshot

On Finding Optimal Polytrees

inferred← citeshttps://doi.org/10.2507/ijsimm20-1-co4openalex-snapshot

E-Commerce Workshop Scheduling Based on Deep Learning and Genetic Algorithm

inferred← citeshttps://doi.org/10.48550/arxiv.1208.1692openalex-snapshot

On Finding Optimal Polytrees

inferred← citeshttps://doi.org/10.48550/arxiv.1911.10765openalex-snapshot

Faster Matroid Intersection

inferred← citeshttps://doi.org/10.5555/1283383.1283430openalex-snapshot

An algebraic algorithm for weighted linear matroid intersection

inferred← citeshttps://doi.org/10.5555/2884435.2884468openalex-snapshot

A fast approximation for maximum weight matroid intersection

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.