尾巴 发表于 2025-3-23 11:53:18

http://reply.papertrans.cn/16/1532/153153/153153_11.png

讨厌 发表于 2025-3-23 14:49:36

https://doi.org/10.1007/978-3-658-19626-4A terrain is an .-monotone polygon whose lower boundary is a single line segment. We present an algorithm to find in a terrain a triangle of largest area in . time, where . is the number of vertices defining the terrain. The best previous algorithm for this problem has a running time of ..

来就得意 发表于 2025-3-23 20:51:57

Improved Bounds on the Spanning Ratio of the Theta-5-Graph,We show an upper bound of . on the spanning ratio of .-graphs, improving on the previous best known upper bound of .

猛击 发表于 2025-3-24 00:06:00

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time,A terrain is an .-monotone polygon whose lower boundary is a single line segment. We present an algorithm to find in a terrain a triangle of largest area in . time, where . is the number of vertices defining the terrain. The best previous algorithm for this problem has a running time of ..

嘲笑 发表于 2025-3-24 04:19:17

http://reply.papertrans.cn/16/1532/153153/153153_15.png

gnarled 发表于 2025-3-24 10:16:03

978-3-030-83507-1Springer Nature Switzerland AG 2021

夜晚 发表于 2025-3-24 13:14:27

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153153.jpg

抗生素 发表于 2025-3-24 18:14:57

http://reply.papertrans.cn/16/1532/153153/153153_18.png

甜食 发表于 2025-3-24 21:17:31

http://reply.papertrans.cn/16/1532/153153/153153_19.png

parasite 发表于 2025-3-25 00:20:31

https://doi.org/10.1007/978-3-322-81608-5ion can influence the duration of a task. Jobs have an unknown processing time that can be explored by running a test. Alternatively, jobs can be executed for the duration of a given upper limit. We consider this problem within the setting of multiple identical parallel machines and present competit
页: 1 [2] 3 4 5 6 7
查看完整版本: Titlebook: Algorithms and Data Structures; 17th International S Anna Lubiw,Mohammad Salavatipour,Meng He Conference proceedings 2021 Springer Nature S