Dappled 发表于 2025-4-1 02:17:03

Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems,blem is fairly close to the inapproximability bound of about 0.954 obtained by Håstad. The performance ratio obtained for the MAX DI-CUT problem is very close to the performance ratio of about 0.878 obtained by Goemans and Williamson for the MAX CUT problem.

Fermentation 发表于 2025-4-1 07:57:34

http://reply.papertrans.cn/47/4683/468255/468255_62.png
页: 1 2 3 4 5 6 [7]
查看完整版本: Titlebook: Integer Programming and Combinatorial Optimization; 9th International IP William J. Cook,Andreas S. Schulz Conference proceedings 2002 Spri