日本語
 
Help Privacy Policy ポリシー/免責事項
  詳細検索ブラウズ

アイテム詳細


公開

学術論文

Static and Dynamic Algorithms for k-point Clustering Problems

MPS-Authors
/persons/resource/persons295559

Datta,  Amitava
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44909

Lenhof,  Hans-Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45433

Schwarz,  Christian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45509

Smid,  Michiel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
There are no locators available
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
フルテキスト (公開)
公開されているフルテキストはありません
付随資料 (公開)
There is no public supplementary material available
引用

Datta, A., Lenhof, H.-P., Schwarz, C., & Smid, M. (1995). Static and Dynamic Algorithms for k-point Clustering Problems. Journal of Algorithms, 19(3), 474-503. doi:10.1006/jagm.1995.1048.


引用: https://hdl.handle.net/11858/00-001M-0000-0014-ACCF-4
要旨
要旨はありません