The following pages link to Robust Matchings (Q4785699):
Displayed 13 items.
- An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes (Q844164) (← links)
- Approximation algorithms for maximum latency and partial cycle cover (Q1015324) (← links)
- Randomized strategies for cardinality robustness in the knapsack problem (Q1675929) (← links)
- Approximation algorithms for the metric maximum clustering problem with given cluster sizes. (Q1811624) (← links)
- Computing knapsack solutions with cardinality robustness (Q1926647) (← links)
- Surrogate optimization for \(p\)-norms (Q2010926) (← links)
- Fractionally subadditive maximization under an incremental knapsack constraint (Q2085751) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- Robust Randomized Matchings (Q5219560) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
- Robust Independence Systems (Q5892606) (← links)
- Randomized strategies for robust combinatorial optimization with approximate separation (Q6182680) (← links)
- Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows (Q6202753) (← links)