Cleave
发表于 2025-3-23 13:46:48
http://reply.papertrans.cn/16/1533/153293/153293_11.png
角斗士
发表于 2025-3-23 16:11:12
https://doi.org/10.1007/978-3-7091-4012-3n self-intersecting polygons with an unfolding in 4d. In contrast to this old result, our NP-hardness reductions are substantially simpler..As a positive result we show that the Fréchet distance between polygons with one hole can be computed in polynomial time.
细颈瓶
发表于 2025-3-23 21:03:49
Der historische Roman und seine Formen,the running-time is .(.log. + (. + |.|).)..This is an extension of an algorithm by Erickson and Whittlesey [., 1038–1046 (2005)], which computes a shortest cut graph with a single given vertex. Moreover, our proof is simpler and also reveals that the algorithm actually computes a minimum-weight basis of some matroid.
充气女
发表于 2025-3-23 23:31:13
http://reply.papertrans.cn/16/1533/153293/153293_14.png
埋葬
发表于 2025-3-24 05:29:21
http://reply.papertrans.cn/16/1533/153293/153293_15.png
farewell
发表于 2025-3-24 10:03:03
http://reply.papertrans.cn/16/1533/153293/153293_16.png
蛙鸣声
发表于 2025-3-24 12:01:00
Shortest Cut Graph of a Surface with Prescribed Vertex Setthe running-time is .(.log. + (. + |.|).)..This is an extension of an algorithm by Erickson and Whittlesey [., 1038–1046 (2005)], which computes a shortest cut graph with a single given vertex. Moreover, our proof is simpler and also reveals that the algorithm actually computes a minimum-weight basis of some matroid.
不舒服
发表于 2025-3-24 17:10:48
A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Tieswhen preference lists of one side do not contain ties, and it cannot be approximated within . unless P=NP. However, even under this restriction, the best known approximation ratio is still 1.5. In this paper, we improve it to ..
伦理学
发表于 2025-3-24 22:56:22
Pairing Heaps with Costless Meldre . is the size of the priority queue at the time the operation is performed. These bounds are the best known for any self-adjusting heap, and match the lower bound established by Fredman for a family of such priority queues. Moreover, our structure is even simpler than that in .
ingenue
发表于 2025-3-25 02:36:31
http://reply.papertrans.cn/16/1533/153293/153293_20.png