Pages that link to "Item:Q3503853"
From MaRDI portal
The following pages link to Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (Q3503853):
Displaying 8 items.
- Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs (Q328705) (← links)
- Approximation algorithms for maximum latency and partial cycle cover (Q1015324) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects (Q2060557) (← links)
- Almost exact matchings (Q2429356) (← links)
- Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
- On Lagrangian Relaxation and Subset Selection Problems (Q3602837) (← links)