Obnoxious facility location on graphs
SIAM Journal on Discrete Mathematics
Using homogenous weights for approximating the partial cover problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the maximum quadratic assignment problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Hybrid Ant-Based Approach to the Economic Triangulation Problem for Input-Output Tables
HAIS '09 Proceedings of the 4th International Conference on Hybrid Artificial Intelligence Systems
| Hi-index | 0.00 |
The GENERALIZED MAXIMUM LINEAR ARRANGEMENT PROBLEM is to compute for a given vector x ∈ Rn and an n × n non-negative symmetric matrix w = (wi,j), a permutation π of {1, ..., n} that maximizes Σi,j wπi, πj |xj - xi|. We present a fast 1/3-approximation algorithm for the problem. We also introduce a 1/2-approximation algorithm for MAX k-CUT WITH GIVEN SIZES. This matches the bound obtained by Ageev and Sviridenko, but without using linear programming.