Titlebook: Algorithms - ESA 2000; 8th Annual European Mike S. Paterson Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2000 Approximati

Eisenhower

书目名称Algorithms - ESA 2000影响因子(影响力)




书目名称Algorithms - ESA 2000影响因子(影响力)学科排名




书目名称Algorithms - ESA 2000网络公开度




书目名称Algorithms - ESA 2000网络公开度学科排名




书目名称Algorithms - ESA 2000被引频次




书目名称Algorithms - ESA 2000被引频次学科排名




书目名称Algorithms - ESA 2000年度引用




书目名称Algorithms - ESA 2000年度引用学科排名




书目名称Algorithms - ESA 2000读者反馈




书目名称Algorithms - ESA 2000读者反馈学科排名

欢笑

AMITY

Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphsfor trees, no polynomial time algorithm for p-median problem has been reported for any large class of graphs. We introduce a . of computation and show how to solve the .-center problem on an circular-arc graph in . time, assuming that the arc endpoints are sorted.

表否定

K-D Trees Are Better when Cut on the Longest Sideve been empirically shown to exhibit polylogarithmic performance, and under certain restrictions in the data distribution some theoretical expected case results have been proven. This result, however, is the first one proving a worst-case polylogarithmic time bound for approximate geometric queries using the simple .-d tree data structure.

闪光东本

Spangle

Planspiele als Methode im Politikunterricht,is known to be approximable within a factor of 0.72 of the optimum (Andersson and Engebretsen, 1998). The authors (1999) designed an 0.5-approximation for the special case when the hypergraph is a graph. The main result of this paper is that ...-.. GSP can be approximated within a factor of min. of the optimum, where ..

Nonflammable

闲聊

Anal-Canal

Planspiele als Methode im Politikunterricht,uence σ of requests one has to serve in turn, we are interested in the minimal cost needed to serve all requests. Little is known about this problem. The best algorithm so far needs exponential time in the number of items in the list. We show that there is no poly-nomial algorithm unless ..

GULF

,IT-GESTÜTZTES SOCIAL NETWORKING,r. By the same method we prove an .(..β(.)) upper bound on the number of triangles congruent to a given one among . points in threedimensional space, improving an .(..)-bound of Akutsu et al. The corresponding lower bound for both problems is Ω(..).