Pages that link to "Item:Q3583302"
From MaRDI portal
The following pages link to Minconvex Factors of Prescribed Size in Graphs (Q3583302):
Displaying 14 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs (Q820559) (← links)
- Induction of M-convex functions by linking systems (Q997074) (← links)
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) (← links)
- Uniform and monotone line sum optimization (Q2028097) (← links)
- Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
- A note on M-convex functions on jump systems (Q2217499) (← links)
- On line sum optimization (Q2228118) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- On degree sequence optimization (Q2661577) (← links)
- Optimization over degree sequences of graphs (Q2663988) (← links)
- Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors (Q3439567) (← links)
- Degree sequence optimization in bounded treewidth (Q6097483) (← links)
- Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids (Q6180564) (← links)
