Hardness of Graph Pricing Through Generalized Max-Dicut

DOI10.1145/2746539.2746549zbMath1321.68287arXiv1405.0740OpenAlexW2064035344MaRDI QIDQ2941530

Euiwoong Lee

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmshardness of approximationgraph pricing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Signed and weighted graphs (05C22)

Related Items (4)

Graph pricing with limited supply ⋮ On the approximability of digraph ordering ⋮ Unnamed Item ⋮ The Quest for Strong Inapproximability Results with Perfect Completeness

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

This page was built for publication: Hardness of Graph Pricing Through Generalized Max-Dicut