The following pages link to Algorithm Theory - SWAT 2004 (Q5315397):
Displaying 17 items.
- Constrained multi-object auctions and \(b\)-matching (Q294790) (← links)
- 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)
- Simple combinatorial auctions with budget constraints (Q2006772) (← links)
- On envy-free revenue approximation for combinatorial buyers with budgets (Q2032294) (← links)
- Approximating the optimal sequence of acquisitions and sales with a capped budget (Q2348705) (← links)
- New bounds for the balloon popping problem (Q2354305) (← links)
- Unconditional competitive auctions with copy and budget constraints (Q2481947) (← links)
- Budget constrained auctions with heterogeneous items (Q2875165) (← links)
- Budget-constrained auctions with heterogeneous items (Q2913820) (← links)
- First‐price auctions with budget constraints (Q3299508) (← links)
- Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders (Q4997307) (← links)