The following pages link to (Q5743495):
Displayed 8 items.
- Matroid and knapsack center problems (Q300451) (← links)
- New approaches to multi-objective optimization (Q403670) (← links)
- Chain-constrained spanning trees (Q1702777) (← links)
- Refuting a conjecture of goemans on bounded degree spanning trees (Q1709958) (← links)
- Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems (Q1800987) (← links)
- \(k\)-trails: recognition, complexity, and approximations (Q1800995) (← links)
- Popular Matchings with Ties and Matroid Constraints (Q5351863) (← links)
- Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)