5 search results - page 1 / 1 » Polylogarithmic inapproximability |
STOC
2003
ACM
14 years 4 months ago
2003
ACM
COCO
2008
Springer
13 years 6 months ago
2008
Springer
![Approximation of Natural W[P]-Complete Minimisation Problems Is Hard](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Approximation of Natural W[P]-Complete Minimisation Problems Is Hard")
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
ESA
2007
Springer
13 years 10 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...