A constant-factor approximately optimal solution to the Witsenhausen counterexample.
Se Yong ParkPulkit GroverAnant SahaiPublished in: CDC (2009)
Keyphrases
- constant factor
- optimal solution
- lower bound
- approximation algorithms
- np hard
- upper bound
- worst case
- branch and bound
- linear programming
- model checking
- branch and bound algorithm
- knapsack problem
- search space
- objective function
- feasible solution
- linear program
- linear programming relaxation
- lower and upper bounds
- sample complexity
- metaheuristic
- theoretical analysis
- approximation guarantees