Titlebook: Algorithms -- ESA 2010, Part II; 18th Annual European Mark Berg,Ulrich Meyer Conference proceedings 2010 Springer-Verlag Berlin Heidelberg

Cleave

角斗士

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.

細(xì)頸瓶

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.

充氣女

埋葬

farewell

蛙鳴聲

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.

不舒服

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 ..

倫理學(xué)

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 [1].

ingenue