Pages that link to "Item:Q2448960"
From MaRDI portal
The following pages link to Degree bounded matroids and submodular flows (Q2448960):
Displayed 9 items.
- Assignment problems with complementarities (Q308621) (← links)
- \(k\)-trails: recognition, complexity, and approximations (Q1800995) (← links)
- Stochastic packing integer programs with few queries (Q2191766) (← links)
- An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality (Q2353642) (← links)
- Design and Topological Analysis of Complex Networks with Optimal Controllability (Q2930507) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)
- On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)