http://swrc.ontoware.org/ontology#TechnicalReport
Efficient Algorithms for the Partial Sum Dispersion Problem
en
Department of Computer Science, Gunma University
Faculty of System Design, Tokyo Metropolitan University
Faculty of System Design, Tokyo Metropolitan University
Department of Computer Science, Gunma University
Toshihiro Akagi
Tetsuya Araki
Hiroshi Ishikawa
Shin-ichi Nakano
The dispersion problem is a variant of the facility location problem. Given a set P of n points and an integer k, we intend to find a subset S of P with
The dispersion problem is a variant of the facility location problem. Given a set P of n points and an integer k, we intend to find a subset S of P with
AN1009593X
研究報告アルゴリズム（AL）
2017-AL-165
9
1-4
2017-11-09
2188-8566