Titlebook: WALCOM: Algorithm and Computation; 6th International Wo Md. Saidur Rahman,Shin-ichi Nakano Conference proceedings 2012 The Editor(s) (if ap

Sentry

書(shū)目名稱(chēng)WALCOM: Algorithm and Computation影響因子(影響力)




書(shū)目名稱(chēng)WALCOM: Algorithm and Computation影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)WALCOM: Algorithm and Computation網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)WALCOM: Algorithm and Computation網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)WALCOM: Algorithm and Computation被引頻次




書(shū)目名稱(chēng)WALCOM: Algorithm and Computation被引頻次學(xué)科排名




書(shū)目名稱(chēng)WALCOM: Algorithm and Computation年度引用




書(shū)目名稱(chēng)WALCOM: Algorithm and Computation年度引用學(xué)科排名




書(shū)目名稱(chēng)WALCOM: Algorithm and Computation讀者反饋




書(shū)目名稱(chēng)WALCOM: Algorithm and Computation讀者反饋學(xué)科排名

牽索

Increment

無(wú)目標(biāo)

Approximability of Stable Matching Problems of two natural relaxations, allowing ties and incomplete lists, has been started shortly after the Gale-Shapley paper, and before long it turned out that there are still linear time algorithms, namely the problem does not become inherently harder, if we allow either one of the two relaxations.

Mast-Cell

格子架

高談闊論

易發(fā)怒

Comparing and Aggregating Partial Orders with Kendall Tau Distances problem is known to be .-complete for total and bucket orders, even for four voters and solvable in . for two voters. It is .-complete for two partial orders and the nearest neighbor Kendall tau distance. For the Hausdorff Kendall tau distance it is in ., but not in . or . unless ., even for four v

mutineer

On the Round-Trip 1-Center and 1-Median Problemse. In addition, assuming that a matrix that stores the shortest distances between every pair of vertices is given, we give an .(.?∑?. min {|..|, .}?+?.|.|)-time algorithm. Our improvement comes from a technique which we use to reduce each set ... This technique may also be useful in solving the depo

defeatist

On the Round-Trip 1-Center and 1-Median Problemse. In addition, assuming that a matrix that stores the shortest distances between every pair of vertices is given, we give an .(.?∑?. min {|..|, .}?+?.|.|)-time algorithm. Our improvement comes from a technique which we use to reduce each set ... This technique may also be useful in solving the depo