A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
From MaRDI portal
Publication:3527234
DOI10.1007/978-3-540-75520-3_41zbMath1151.91441OpenAlexW2158649143MaRDI QIDQ3527234
Yan Zhang, R. A. Sitters, Khaled M. Elbassioni
Publication date: 25 September 2008
Published in: Algorithms – ESA 2007 (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/2e735493-8e1a-4db0-b6e3-7384e1f3d521
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Microeconomic theory (price theory and economic markets) (91B24)
Related Items (12)
Approximating the Interval Constrained Coloring Problem ⋮ Approximation algorithms for the interval constrained coloring problem ⋮ An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph ⋮ On stackelberg pricing with computationally bounded customers ⋮ Optimal bundle pricing with monotonicity constraint ⋮ On the complexity of the highway problem ⋮ Unnamed Item ⋮ Price strategy implementation ⋮ Pricing on Paths: A PTAS for the Highway Problem ⋮ Online pricing for bundles of multiple items ⋮ Envy-free pricing in multi-item markets ⋮ Unnamed Item
This page was built for publication: A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
