2698 search results - page 14 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
WG
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
ORL
2007
13 years 7 months ago
2007
ISAAC
2001
Springer
14 years 1 days ago
2001
Springer
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
STOC
1999
ACM
13 years 12 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...