Minconvex Factors of Prescribed Size in Graphs
From MaRDI portal
Publication:3583302
DOI10.1137/060651136zbMath1207.05151OpenAlexW1996988774MaRDI QIDQ3583302
Publication date: 27 August 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060651136
Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (14)
Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs ⋮ Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs ⋮ On degree sequence optimization ⋮ Optimization over degree sequences of graphs ⋮ Degree sequence optimization in bounded treewidth ⋮ Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids ⋮ A note on M-convex functions on jump systems ⋮ The maximum vertex coverage problem on bipartite graphs ⋮ On line sum optimization ⋮ Uniform and monotone line sum optimization ⋮ Induction of M-convex functions by linking systems ⋮ Decreasing minimization on M-convex sets: algorithms and applications ⋮ Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors ⋮ Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs
This page was built for publication: Minconvex Factors of Prescribed Size in Graphs
