Travelled to:1 × Austria
1 × Germany
1 × Hungary
Collaborated with:M.J.Golin ∅ H.Edelsbrunner E.Welzl
Talks about:optim (2) construct (1) algorithm (1) shortest (1) program (1) polygon (1) necklac (1) between (1) metric (1) letter (1)
Person: Günter Rote
DBLP: Rote:G=uuml=nter
Contributed to:
199519921987Wrote 3 papers:
- ICALP-1995-GolinR #algorithm #programming
- A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs (MJG, GR), pp. 256–267.
- ICALP-1992-Rote #how #metric
- A New Metric Between Polygons and How to Compute it (GR), pp. 404–415.
- ICALP-1987-EdelsbrunnerRW #testing
- Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane (HE, GR, EW), pp. 364–375.