Pages that link to "Item:Q3087101"
From MaRDI portal
The following pages link to Iterative Methods in Combinatorial Optimization (Q3087101):
Displaying 10 items.
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947) (← links)
- (Q5743405) (← links)
- An Improved Approximation Algorithm for the Matching Augmentation Problem (Q5883280) (← links)
- Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)
- Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923) (← links)
- Proper orientations and proper chromatic number (Q6038578) (← links)
- Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
- On colorful vertex and edge cover problems (Q6088300) (← links)
- Eigenpolytope Universality and Graphical Designs (Q6195955) (← links)
- Discrepancy theory and related algorithms (Q6200209) (← links)
