Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,935,278 papers from all fields of science
Search
Sign In
Create Free Account
Weighted matroid
In combinatorics, a branch of mathematics, a weighted matroid is a matroid endowed with function with respect to which one can perform a greedy…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Greedoid
Greedy algorithm
Jack Edmonds
Matroid
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
via Weighted Matroid Matching
Shortest Disjoint Non-zero A-paths
2015
Corpus ID: 124495246
2011
2011
Optimality conditions for a bilevel matroid problem
D. Fanghänel
Journal of combinatorial optimization
2011
Corpus ID: 20588588
In bilevel programming there are two decision makers, the leader and the follower, who act in a hierarchy. In this paper we deal…
Expand
2011
2011
MS & E-319 : Approximation Algorithms
2011
Corpus ID: 41152997
1. Problem 22.12 of Vazirani’s book: (Prömel and Steger [2]) This exercise develops an algorithm for the Steiner tree problem…
Expand
2009
2009
AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT
A. Frank
,
J. V. Vate
,
F. Glover
2009
Corpus ID: 67839231
An efficient cost scaling algorithm is presented for the independent assignment problem of Iri and Tomizawa, which is equivalent…
Expand
1996
1996
K Best Bases of a Weighted Matroid
Tomomi Matsui
,
Yasuko Matsui
1996
Corpus ID: 126263146
1983
1983
On a "primal" matroid intersection algorithm
Orlin James B.
,
J. Vandevate
1983
Corpus ID: 13305024
Given two matroids M1 = (S, 1 1 ) and M2 = (S, 12) and a weight function s on S, the weighted matroid intersection problem is to…
Expand