7129 search results - page 42 / 1426 » Approximation Algorithms for Treewidth |
DAC
1996
ACM
15 years 1 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
JMLR
2012
13 years 5 days 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...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
STOC
2003
ACM
15 years 10 months ago
2003
ACM
117
click to vote
COMGEO
2012
ACM
13 years 5 months ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...