نتایج جستجو برای: biobjective shortest path
تعداد نتایج: 150842 فیلتر نتایج به سال:
1 This paper studies algorithmic and combinatorial properties of shortest paths of different homo2 topy types in a polygonal domain with holes. We define the “second shortest path” to be the shortest 3 path that is homotopically different from the (first) shortest path; the kth shortest path for an arbitrary 4 integer k is defined analogously. We introduce the “kth shortest path map”—a structur...
A class of cooperative games arising from shortest path problems is deened. These shortest path games are shown to be totally balanced and allow a population-monotonic allocation scheme. Possible methods for obtaining core elements are indicated; rst, by relating to the allocation rules in taxation and bankruptcy problems, second, by constructing an explicit rule that takes opportunity costs in...
A beer graph is an undirected G, in which each edge has a positive weight and some vertices have store. path between two u v G any that visits at least one We show outerplanar with n can be preprocessed O(n) time into data structure of size O(n), such for query v, (i) the shortest reported $$O(\alpha (n))$$ (where $$\alpha (n)$$ inverse Ackermann function), (ii) O(L) time, where L number on thi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید