Pages that link to "Item:Q1680508"
From MaRDI portal
The following pages link to FPT approximation schemes for maximizing submodular functions (Q1680508):
Displaying 11 items.
- FPT approximation schemes for maximizing submodular functions (Q1680508) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives (Q2417370) (← links)
- Interactive optimization of submodular functions under matroid constraints (Q2695451) (← links)
- SFO: a toolbox for submodular function optimization (Q2896071) (← links)
- (Q2959839) (redirect page) (← links)
- The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity (Q3462365) (← links)
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
- Fast parallel algorithms for submodular \(p\)-superseparable maximization (Q6574951) (← links)
- A mechanism for participatory budgeting with funding constraints and project interactions (Q6609153) (← links)