631 search results - page 46 / 127 » Additive Approximation for Edge-Deletion Problems |
112
click to vote
JMLR
2012
13 years 5 days ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...
SIAMDM
2002
14 years 9 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
128
click to vote
SIAMCOMP
2010
14 years 8 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
WINE
2009
Springer
15 years 2 months ago
2009
Springer
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...