Results 1 
6 of
6
Optimal inapproximability results for MAXCUT and other 2variable CSPs?
, 2005
"... In this paper we show a reduction from the Unique Games problem to the problem of approximating MAXCUT to within a factor of ffGW + ffl, for all ffl> 0; here ffGW ss.878567 denotes the approximation ratio achieved by the GoemansWilliamson algorithm [25]. This implies that if the Unique Games ..."
Abstract

Cited by 173 (24 self)
 Add to MetaCart
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAXCUT to within a factor of ffGW + ffl, for all ffl> 0; here ffGW ss.878567 denotes the approximation ratio achieved by the GoemansWilliamson algorithm [25]. This implies that if the Unique Games
Fixing Variables in Semidefinite Relaxations
 SIAM J. MATRIX ANAL. APPL
, 1996
"... The standard technique of reduced cost fixing from linear programming is not trivially extensible to semidefinite relaxations as the corresponding Lagrange multipliers are usually not available. We propose a general technique for computing reasonable Lagrange multipliers to constraints which are not ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
The standard technique of reduced cost fixing from linear programming is not trivially extensible to semidefinite relaxations as the corresponding Lagrange multipliers are usually not available. We propose a general technique for computing reasonable Lagrange multipliers to constraints which are not part of the problem description. Its specialization to the semidefinite f\Gamma1; 1g relaxation of quadratic 01 programming yields an efficient routine for fixing variables. The routine offers the possibility to exploit problem structure. We extend the traditional bijective map between f0; 1g and f\Gamma1; 1g formulations to the constraints such that the dual variables remain the same and structural properties are preserved. In consequence the fixing routine can efficiently be applied to optimal solutions of the semidefinite f0; 1g relaxation of constrained quadratic 01 programming, as well. We provide numerical results showing the efficacy of the approach.
Semidefinite Programming
, 1999
"... Due to its many applications in control theory, robust optimization, combinatorial optimization and eigenvalue optimization, semidefinite programming had been in wide spread use even before the development of efficient algorithms brought it into the realm of tractability. Today it is one of the basi ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Due to its many applications in control theory, robust optimization, combinatorial optimization and eigenvalue optimization, semidefinite programming had been in wide spread use even before the development of efficient algorithms brought it into the realm of tractability. Today it is one of the basic modeling and optimization tools along with linear and quadratic programming. Our survey is an introduction to semidefinite programming, its duality and complexity theory, its applications and algorithms.
Cutting Plane Algorithms for Semidefinite Relaxations
 Topics in Semidefinite and InteriorPoint Methods. Fields Institute Communications Series Vol. 18, AMS
, 1997
"... We investigate the potential and limits of interior point based cutting ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We investigate the potential and limits of interior point based cutting
Sdpbased approach for channel assignment in multiradio wireless networks,” Dial MPOMC
, 2007
"... We consider the following channel assignment problem in multiradio multichannel wireless networks: Given a wireless network where k orthogonal channels are available and each node has multiple wireless interfaces, assign a channel to each link so that the total number of conflicts is minimized. We ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the following channel assignment problem in multiradio multichannel wireless networks: Given a wireless network where k orthogonal channels are available and each node has multiple wireless interfaces, assign a channel to each link so that the total number of conflicts is minimized. We present an integer semidefinite programming formulation for the problem and show that it is equivalent to an optimal channel assignment. By relaxing integrality constraints, we can find a lowerbound on the optimal channel assignment. We develop several channel assignment algorithms based on the solution to the SDP relaxation. Our results from numerical evaluations and packetlevel simulations show that our SDPbased rounding algorithms outperform other simple heuristics (up to 200 % improvement in throughput). In particular, our schemes achieve even larger performance improvement when nodes
Soft edge coloring
 In APPROX
, 2007
"... Abstract. We consider the following channel assignment problem arising in wireless networks. We are given a graph G = (V, E), and the number of wireless cards Cv for all v, which limit the number of colors that edges incident to v can use. We also have the total number of channels CG available in th ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We consider the following channel assignment problem arising in wireless networks. We are given a graph G = (V, E), and the number of wireless cards Cv for all v, which limit the number of colors that edges incident to v can use. We also have the total number of channels CG available in the network. For a pair of edges incident to a vertex, they are said to be conflicting if the colors assigned to them are the same. Our goal is to color edges (assign channels) so that the number of conflicts is minimized. We first consider the homogeneous network where Cv = k and CG ≥ Cv for all nodes v. The problem is NPhard by a reduction from EDGE COLORING and we present two combinatorial algorithms for this case. The first algorithm is a distributed greedy method, which gives a solution with at most (1 − 1)E  more conflicts than the optimal solution. We also present k an algorithm yielding at most V  more conflicts than the optimal solution. The algorithm generalizes Vizing’s algorithm in the sense that it gives the same result as Vizing’s algorithm when k = ∆ + 1. Moreover, we show that this approximation result is best possible unless P = NP. For the case where Cv = 1 or k, we show that the problem is NPhard even when Cv = 1 or 2, and CG = 2, and present two algorithms. The first algorithm is completely combinatorial and produces a solution with at most (2 − 1 1)OP T + (1 −)E  conflicts. We also develop an k k SDPbased algorithm, producing a solution with at most 1.122OP T + 0.122E ln k ln k conflicts for k = 2, and (2 − Θ ())OP T + (1 − Θ ())E  conflicts in k k general. 1