1389 search results - page 40 / 278 » Improved Approximation Algorithms for Label Cover Problems |
120
Voted
HICSS
2008
IEEE
14 years 12 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.82...
100
click to vote
CGF
2006
14 years 11 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
132
click to vote
ICDM
2009
IEEE
14 years 9 months ago
2009
IEEE
Hierarchical taxonomies are used to organize and retrieve information in many domains, especially those dealing with large and rapidly growing amounts of information. In many of t...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...