Pages that link to "Item:Q5313023"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313023):
Displaying 12 items.
- Unbalanced graph partitioning (Q372961) (← links)
- A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem (Q896163) (← links)
- \(\ell_p\)-norm multiway cut (Q2165036) (← links)
- An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- Cut problems in graphs with a budget constraint (Q2457298) (← links)
- Unbalanced graph cuts with minimum capacity (Q2515430) (← links)
- Submodular Cost Allocation Problem and Applications (Q3012819) (← links)
- Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition (Q5002702) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5918433) (← links)
- Posimodular function optimization (Q5918641) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5925652) (← links)
