Randomized algorithms
Increasing the weight of minimum spanning trees
Journal of Algorithms
Approximation algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Edge-disjoint trees containing some given vertices in a graph
Journal of Combinatorial Theory Series B
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Fastest Mixing Markov Chain on a Graph
SIAM Review
On the Complexity of Succinct Zero-Sum Games
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Online convex optimization in the bandit setting: gradient descent without a gradient
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Playing games with approximation algorithms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Design is as Easy as Optimization
SIAM Journal on Discrete Mathematics
A learning-based approach to reactive security
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
| Hi-index | 0.00 |
We identify a new genre of algorithmic problems – design problems – and study them from an algorithmic and complexity-theoretic view point. We use the learning techniques of Freund-Schapire [FS99] and its generalizations to show that for a large class of problems, the design version is as easy as the optimization version.