7006 search results - page 315 / 1402 » Approximation Algorithms |
114
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract: We introduce the snowblower problem (SBP), a new optimization problem that is closely related to milling problems and to some material-handling problems. The objective in...
113
click to vote
DAM
2007
15 years 4 months ago
2007
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
137
click to vote
JMLR
2012
13 years 6 months ago
2012
Bisubmodularity extends the concept of submodularity to set functions with two arguments. We show how bisubmodular maximization leads to richer value-of-information problems, usin...
144
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
135
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...