Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results.
Georgios AmanatidisEvangelos MarkakisKrzysztof SornatPublished in: MFCS (2016)
Keyphrases
- approximation algorithms
- social networks
- np hard
- np hardness
- worst case
- special case
- social network analysis
- vertex cover
- minimum cost
- link prediction
- primal dual
- np complete
- precedence constraints
- facility location problem
- lower bound
- network design problem
- integer programming
- optimal solution
- phase transition
- linear programming
- computational complexity
- mechanism design
- set cover
- approximation ratio
- knapsack problem
- combinatorial auctions
- constraint satisfaction problems
- randomized algorithms
- scheduling problem
- open shop
- approximation schemes
- simulated annealing
- greedy heuristic
- complex networks
- branch and bound algorithm