114 citations
- Technische Universität BraunschweigDE4 papers
- Stanford UniversityUS2 papers
- Applied Mathematics (United States)US1 paper
- Australian National UniversityAU1 paper
- Carleton UniversityCA1 paper
- Columbia UniversityUS1 paper
- Ghent UniversityBE1 paper
- Icahn School of Medicine at Mount SinaiUS1 paper
- Kavli Institute for Particle Astrophysics and CosmologyUS1 paper
- Lakehead UniversityCA1 paper
- Leiden Observatory1 paper
- Leiden UniversityNL1 paper
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2004★ 3 cited
Communication-Aware Processor Allocation for Supercomputers
Michael A. Bender, David P. Bunde, Erik D. Demaine +4
This paper gives processor-allocation algorithms for minimizing the average number of communication hops between the assigned processors for grid architectures, in the presence of…
cs.DS2003
Maximum dispersion and geometric maximum weight cliques
Sandor P. Fekete, Henk Meijer
We consider a facility location problem, where the objective is to ``disperse'' a number of facilities, i.e., select a given number k of locations from a discrete set of n candidat…
cs.DS2002
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems
Sandor P. Fekete, Henk Meijer, Andre Rohe +1
We consider geometric instances of the Maximum Weighted Matching Problem (MWMP) and the Maximum Traveling Salesman Problem (MTSP) with up to 3,000,000 vertices. Making use of a geo…