Sciweavers

8 search results - page 1 / 2
» Polynomial flow-cut gaps and hardness of directed cut proble...
Sort
View
74
Voted
STOC
2007
ACM
91views Algorithms» more  STOC 2007»
15 years 10 months ago
Polynomial flow-cut gaps and hardness of directed cut problems
Julia Chuzhoy, Sanjeev Khanna
CSR
2007
Springer
15 years 4 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
FOCS
2008
IEEE
15 years 4 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
ATAL
2010
Springer
14 years 11 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
14 years 10 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna