The following pages link to Algorithm Theory - SWAT 2004 (Q5315397):
Displaying 7 items.
- Valuated matroid-based algorithm for submodular welfare problem (Q492835) (← links)
- Maximum bipartite flow in networks with adaptive channel width (Q541660) (← links)
- The balloon popping problem revisited: lower and upper bounds (Q647488) (← links)
- On the configuration LP for maximum budgeted allocation (Q896296) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- Repeated budgeted second price ad auction (Q1678769) (← links)
- 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines (Q1799571) (← links)
