3874 search results - page 328 / 775 » Approximation Algorithms for k-hurdle Problems |
126
click to vote
DATE
2006
IEEE
15 years 11 months ago
2006
IEEE
The energy-aware design for electronic systems has been an important issue in hardware and/or software implementations, especially for embedded systems. This paper targets a synth...
158
click to vote
SIAMCOMP
2010
15 years 3 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
128
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
156
click to vote
LATIN
2010
Springer
15 years 3 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
171
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...