Inequity aversion pricing over social networks: Approximation algorithms and hardness results.
Georgios AmanatidisPeter FullaEvangelos MarkakisKrzysztof SornatPublished in: Theor. Comput. Sci. (2021)
Keyphrases
- approximation algorithms
- social networks
- np hard
- np hardness
- worst case
- special case
- vertex cover
- np complete
- social network analysis
- network design problem
- facility location problem
- set cover
- primal dual
- undirected graph
- minimum cost
- approximation ratio
- lower bound
- computational complexity
- linear programming
- link prediction
- open shop
- optimal solution
- precedence constraints
- linear program
- constraint satisfaction problems
- upper bound
- scheduling problem
- disjoint paths
- phase transition
- constant factor
- network effects
- constant factor approximation
- approximation schemes
- randomized algorithms
- integer programming
- knapsack problem