A sublogarithmic approximation for tollbooth pricing on trees

DOI10.1287/MOOR.2016.0803MaRDI QIDQ5739145zbMATH OpenOpenAlexFDO

Authors Iftah Gamzu, Danny Segev

Publication date 2 June 2017

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.2016.0803

zbMATH Keywords

approximation algorithmsbalanced decompositionshighway problempricingrandomizationsegment guessingtollbooth problemtrees

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic network models in operations research (90B10)

Recommendations

• A sublogarithmic approximation for highway and tollbooth pricing
• On profit-maximizing pricing for the highway and tollbooth problems
• Improved hardness results for profit maximization pricing problems with unlimited supply
• An approximation algorithm for Stackelberg network pricing
• A path-decomposition theorem with applications to pricing and covering on trees

Cited in

(4)

• A path-decomposition theorem with applications to pricing and covering on trees
• Improved hardness results for profit maximization pricing problems with unlimited supply
• A sublogarithmic approximation for highway and tollbooth pricing
• On profit-maximizing pricing for the highway and tollbooth problems

This page was built for publication: A sublogarithmic approximation for tollbooth pricing on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739145)