Combination can be hard
From MaRDI portal
Publication:3581529
DOI10.1145/1109557.1109577zbMath1192.68316OpenAlexW4248663543MaRDI QIDQ3581529
Erik D. Demaine, Mohammad R. Salavatipour, Uriel Feige, Mohammad Taghi Hajiaghayi
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109577
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Pricing loss leaders can be hard ⋮ On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer ⋮ Pricing commodities ⋮ The Parameterized Complexity of the Unique Coverage Problem ⋮ Optimal bundle pricing with monotonicity constraint ⋮ Reducing mechanism design to algorithm design via machine learning ⋮ On the complexity of the highway problem ⋮ Price strategy implementation ⋮ Optimal pricing of capacitated networks ⋮ The Budgeted Unique Coverage Problem and Color-Coding ⋮ Envy-free pricing in multi-item markets ⋮ Unnamed Item
