5 citations · 8 across the 5 of their papers we have counts for
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…
cs.CG2002
Long Proteins with Unique Optimal Foldings in the H-P Model
Oswin Aichholzer, David Bremner, Erik D. Demaine +3
It is widely accepted that (1) the natural or folded state of proteins is a global energy minimum, and (2) in most cases proteins fold to a unique state determined by their amino a…