Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple ..."

Alfredo García Olaverri, Pedro Jodrá, Javier Tejel (2013)

> Home

Details and statistics

DOI: 10.1007/S00453-011-9603-5

access: closed

type: Journal Article

metadata version: 2020-12-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/GarciaJT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/GarciaJT13
Alfredo García Olaverri, Pedro Jodrá, Javier Tejel:
Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon. Algorithmica 65(3): 481-497 (2013)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.