Pages that link to "Item:Q3068630"
From MaRDI portal
The following pages link to On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP (Q3068630):
Displayed 21 items.
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- On the configuration LP for maximum budgeted allocation (Q896296) (← links)
- Generalized assignment problem: truthful mechanism design without money (Q1727952) (← links)
- Improved approximation for spanning star forest in dense graphs (Q1944390) (← links)
- Combinatorial auctions with endowment effect (Q2100637) (← links)
- A simple mechanism for a budget-constrained buyer (Q2190384) (← links)
- Local search algorithms for the maximum carpool matching problem (Q2205630) (← links)
- Improved approximation algorithms for the spanning star forest problem (Q2392922) (← links)
- Complexity and approximability of extended spanning star forest problems in general and complete graphs (Q2419107) (← links)
- Limitations of Deterministic Auction Design for Correlated Bidders (Q2849317) (← links)
- On Variants of the Spanning Star Forest Problem (Q3004657) (← links)
- An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915) (← links)
- APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM (Q4923297) (← links)
- Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders (Q4997307) (← links)
- (Q5111744) (← links)
- On the star forest polytope for trees and cycles (Q5214329) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
- Truthful Generalized Assignments via Stable Matching (Q5244865) (← links)
- Approximating the Spanning k-Tree Forest Problem (Q5321721) (← links)
- Approximation for maximizing monotone non-decreasing set functions with a greedy method (Q5963607) (← links)