626 search results - page 27 / 126 » On Approximability of Minimum Bisection Problem |
ICASSP
2011
IEEE
13 years 5 days ago
2011
IEEE
This paper addresses the problem of beamforming (BF) design for orthogonal frequency division multiplexing (OFDM) based relay networks over frequency-selective channels. Both freq...
WEA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
AAIM
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
DAGSTUHL
2007
13 years 10 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...