| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 485885 | Procedia Computer Science | 2012 | 8 Pages |
Abstract
The problem of finding the minimal tipping set in a super modular game is known to be NP-hard. In this paper, we derive an approximation algorithm to find a minimal tipping set. In the special case of the uniform game, the approximation provides the exact result.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
