Pages that link to "Item:Q3191971"
From MaRDI portal
The following pages link to Randomized metarounding (extended abstract) (Q3191971):
Displaying 12 items.
- Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
- Approximation algorithms for general packing problems and their application to the multicast congestion problem (Q925266) (← links)
- On routing in VLSI design and communication networks (Q944702) (← links)
- On minimizing the maximum congestion for weighted hypergraph embedding in a cycle (Q1014437) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- A simple and fast algorithm for convex decomposition in relax-and-round mechanisms (Q1634087) (← links)
- Truthfulness in advertising? Approximation mechanisms for knapsack bidders (Q1651735) (← links)
- Generalized assignment problem: truthful mechanism design without money (Q1727952) (← links)
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem (Q2102838) (← links)
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs (Q2688462) (← links)
- (Q5002841) (← links)
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory (Q5693011) (← links)
