Pages that link to "Item:Q3191971"
From MaRDI portal
The following pages link to Randomized metarounding (extended abstract) (Q3191971):
Displaying 6 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)
- 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)
