How to Sell a Graph: Guidelines for Graph Retailers

DOI10.1007/11917496_12zbMath1167.91380OpenAlexW2162706182MaRDI QIDQ3522949

Alexander Grigoriev, Marc Uetz, Joyce van Loon, R. A. Sitters

Publication date: 4 September 2008

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11917496_12

zbMATH Keywords

computational complexitydynamic programmingfully polynomial time approximation schemetollbooth problempricing problemshighway problem

Mathematics Subject Classification ID

Games involving graphs (91A43) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (8)

The Stackelberg minimum spanning tree game ⋮ Optimal bundle pricing with monotonicity constraint ⋮ Reducing mechanism design to algorithm design via machine learning ⋮ On the complexity of the highway problem ⋮ On fair price discrimination in multi-unit markets ⋮ Online pricing for bundles of multiple items ⋮ On social envy-freeness in multi-unit markets ⋮ Unnamed Item

This page was built for publication: How to Sell a Graph: Guidelines for Graph Retailers