Sciweavers

3415 search results - page 2 / 683
» Lower Bounds for Kernelizations
Sort
View
DISOPT
2011
177views Education» more  DISOPT 2011»
13 years 5 months ago
Lower bounds on kernelization
Neeldhara Misra, Venkatesh Raman, Saket Saurabh
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 9 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
12 years 1 months ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx
RT
1995
Springer
14 years 2 months ago
Linear Radiosity with Error Estimation
We present a simple and inexpensive method for computing the estimates of error in a hierarchical linear radiosity method. Similar to the approach used in 1 for constant radiosity ...
Sumanta N. Pattanaik, Kadi Bouatouch