497 search results - page 31 / 100 » Approximating max-min linear programs with local algorithms |
SODA
2012
ACM
13 years 5 days ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
116
click to vote
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
100
click to vote
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
ICTAI
2009
IEEE
15 years 4 months ago
2009
IEEE
Evolutionary computation methods have been used to solve several optimization and learning problems. This paper describes an application of evolutionary computation methods to con...