4843 search results - page 318 / 969 » The Shortcut Problem - Complexity and Approximation |
112
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
178
click to vote
FAW
2010
Springer
15 years 4 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
135
click to vote
IPL
2008
15 years 4 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
109
click to vote
ITA
2007
15 years 4 months ago
2007
We explicit the link between the computer arithmetic problem of providing correctly rounded algebraic functions and some diophantine approximation issues. This allows to get bounds...
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...