玩忽职守 发表于 2025-3-30 11:14:07

http://reply.papertrans.cn/17/1605/160458/160458_51.png

BORE 发表于 2025-3-30 15:31:12

http://reply.papertrans.cn/17/1605/160458/160458_52.png

alcohol-abuse 发表于 2025-3-30 17:04:29

http://reply.papertrans.cn/17/1605/160458/160458_53.png

Arthritis 发表于 2025-3-30 22:57:42

http://reply.papertrans.cn/17/1605/160458/160458_54.png

obeisance 发表于 2025-3-31 02:33:15

http://reply.papertrans.cn/17/1605/160458/160458_55.png

Astigmatism 发表于 2025-3-31 08:46:58

Maximum Gradient Embeddings and Monotone Clusteringgs, which we call ., yield a framework for the design of approximation algorithms for a wide range of clustering problems with monotone costs, including fault-tolerant versions of .-median and facility location.

engrave 发表于 2025-3-31 12:00:08

Stanisław Dżułyński,Maria Sass-Gustkiewiczof 0.6 of Nguyen et al. . We also present a 0.64-approximation algorithm for the problem on node-weighted graphs. Finally, we present improved hardness of approximation results for the weighted versions of the problem.

Enliven 发表于 2025-3-31 14:56:46

https://doi.org/10.1007/978-3-642-69817-0provide a family of simple examples for negative type metrics that cannot be embedded into ℓ. with distortion better than 8/7 − .. To this end we prove a new isoperimetric inequality for the hypercube.
页: 1 2 3 4 5 [6]
查看完整版本: Titlebook: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques; 10th International W Moses Charikar,Klaus Jansen,J