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 2002Show all
2 papers · 1 filter
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…
math.AC2002
Box-shaped matrices and the defining ideal of certain blowup surfaces
Huy Tai Ha
We study the defining equations of projective embeddings of the blowup of P^2 at a set of {d+1 \choose 2} number of points in generic position. To do this, we first generalize the…