scientific article; zbMATH DE number 3544074
From MaRDI portal
Publication:4119222
zbMath0349.05026MaRDI QIDQ4119222
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial aspects of matroids and geometric lattices (05B35) Optimality conditions for minimax problems (49K35) Graph theory (05C99) Software, source code, etc. for problems pertaining to calculus of variations and optimal control (49-04)
Related Items
The 2-quasi-greedy algorithm for cardinality constrained matroid bases ⋮ Approximating Bounded Degree Deletion via Matroid Matching ⋮ Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint ⋮ Evolutionary algorithms and matroid optimization problems ⋮ Matroid representation of clique complexes ⋮ Matroidal approximations of independence systems ⋮ A Framework for the Secretary Problem on the Intersection of Matroids ⋮ Randomized strategies for cardinality robustness in the knapsack problem ⋮ Modularity and greed in double auctions ⋮ Computing knapsack solutions with cardinality robustness ⋮ Constrained Submodular Maximization via a Nonsymmetric Technique ⋮ Unified Greedy Approximability beyond Submodular Maximization ⋮ Unified greedy approximability beyond submodular maximization ⋮ Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems ⋮ Hereditary systems and greedy-type algorithms. ⋮ An analysis of the greedy algorithm for partially ordered sets ⋮ Maximize a monotone function with a generic submodularity ratio ⋮ Ranking with Fairness Constraints ⋮ Buyback Problem - Approximate Matroid Intersection with Cancellation Costs ⋮ Surrogate optimization for \(p\)-norms ⋮ On the intersection of independence systems ⋮ Robust Independence Systems ⋮ On approximate algorithms for combinatorial linear maximization problems ⋮ Exact and approximation algorithms for weighted matroid intersection ⋮ Recent trends in combinatorial optimization ⋮ Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem ⋮ Approximation by lexicographically maximal solutions in matching and matroid intersection problems
