scientific article; zbMATH DE number 7053312

zbMath1422.68093MaRDI QIDQ5743433

Yi Wu, Preyas Popat

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095176

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Microeconomic theory (price theory and economic markets) (91B24) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On the complexity of the highway problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pricing loss leaders can be hard
• Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups
• Geometric bounds on the Ornstein-Uhlenbeck velocity process
• On the Complexity of the Highway Pricing Problem
• How to Sell a Graph: Guidelines for Graph Retailers
• A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
• Conditional Hardness for Approximate Coloring
• On the power of unique 2-prover 1-round games
• Two-query PCP with subconstant error
• Combination can be hard
• 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
• On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
• Algorithms and Data Structures
• Some optimal inapproximability results
• Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?

This page was built for publication: