Graph pricing with limited supply

DOI10.1007/978-3-030-83508-8_29OpenAlexW3197169649MaRDI QIDQ832882

Zachary Friggstad, Maryam Mahboub

Publication date: 25 March 2022

Full work available at URL: https://arxiv.org/abs/1912.05010

zbMATH Keywords

linear programminglocal searchapproximation algorithmscapacitated pricinggraph pricing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of local search for the \(p\)-median problem
• Hardness of Graph Pricing Through Generalized Max-Dicut
• Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply
• Single-minded unlimited supply pricing on sparse instances
• A Sublogarithmic Approximation for Highway and Tollbooth Pricing
• On Hardness of Pricing Items for Single-Minded Bidders
• Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS
• Regular Graphs with Given Girth and Restricted Circuits

This page was built for publication: Graph pricing with limited supply