Author:
Demaine Erik D.,Fekete Sándor P.,Rote Günter,Schweer Nils,Schymura Daria,Zelke Mariano
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference21 articles.
1. Polynomial time approximation schemes for dense instances of NP-hard problems;Arora;J. Comput. Syst. Sci.,1999
2. Greedily finding a dense subgraph;Asahiro;J. Algorithms,2000
3. Y. Bartal, M. Charikar, D. Raz, Approximating min-sum k-clustering in metric spaces, in: Proc. 33rd Symposium on Theory of Computing, 2001, pp. 11–20.
4. What is the optimal shape of a city?;Bender;J. Phys. A: Math. Gen.,2004
5. Communication-aware processor allocation for supercomputers: Finding point sets of small average distance;Bender;Algorithmica,2008
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献