overreach 发表于 2025-3-25 03:37:11

http://reply.papertrans.cn/16/1529/152834/152834_21.png

mettlesome 发表于 2025-3-25 10:02:22

Demokratie und Entwicklung in Afrika,nd a matching lower bound of 4 for the unbounded model. We also consider the offline version of these problems and show that the unbounded model is polynomially solvable, while the bounded model is NP-hard in the strong sense and admits a 3.6-approximation algorithm.

MOCK 发表于 2025-3-25 15:27:28

http://reply.papertrans.cn/16/1529/152834/152834_23.png

Estrogen 发表于 2025-3-25 18:44:05

Computervermittelte Kommunikationpolynomial-time .(|.|)-approximation algorithm for . with a single time window and arbitrarily small violations of the triangle inequality..4. Metric TSP with a prescribed linear order on some vertices can be solved in polynomial time with a constant approximation guarantee, even if the triangle inequality is violated by a constant factor.

船员 发表于 2025-3-25 21:42:17

http://reply.papertrans.cn/16/1529/152834/152834_25.png

词汇表 发表于 2025-3-26 00:38:42

Variable Sized Online Interval Coloring with Bandwidthnd a matching lower bound of 4 for the unbounded model. We also consider the offline version of these problems and show that the unbounded model is polynomially solvable, while the bounded model is NP-hard in the strong sense and admits a 3.6-approximation algorithm.

把手 发表于 2025-3-26 07:52:59

http://reply.papertrans.cn/16/1529/152834/152834_27.png

MAPLE 发表于 2025-3-26 10:19:46

On the Approximation Hardness of Some Generalizations of TSPpolynomial-time .(|.|)-approximation algorithm for . with a single time window and arbitrarily small violations of the triangle inequality..4. Metric TSP with a prescribed linear order on some vertices can be solved in polynomial time with a constant approximation guarantee, even if the triangle inequality is violated by a constant factor.

平淡而无味 发表于 2025-3-26 15:43:46

Scheduling Jobs on Grid Processorsems is given at the beginning, and variable-sized bins arrive one by one. A closely related problem was introduced by Zhang in 1997. Our main result answers a question posed in that paper in the affirmative: we give an algorithm with a competitive ratio strictly better than 2, for our problem as well as Zhang’s problem.

出汗 发表于 2025-3-26 17:35:43

http://reply.papertrans.cn/16/1529/152834/152834_30.png
页: 1 2 [3] 4 5 6 7
查看完整版本: Titlebook: Algorithm Theory - SWAT 2006; 10th Scandinavian Wo Lars Arge,Rusins Freivalds Conference proceedings 2006 Springer-Verlag Berlin Heidelberg