Skip to search formSkip to main content

Bitonic tour

Known as: Optimal bitonic tour 
In computational geometry, a bitonic tour of a set of point sites in the Euclidean plane is a closed polygonal chain that has each site as one of its… Expand
Wikipedia

Related topics

Related topics

7 relations
Computational geometryInternational Olympiad in InformaticsIntroduction to AlgorithmsLexicographical order
Expand

Broader (1)

Dynamic programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Product Development in Dark Tourism : Case: Topography of Terror (Berlin, Germany)
Tampereen ammattikorkeakoulu Tampere University of Applied Sciences Degree Programme in Tourism DENISE BÖHME: Product Development… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2011
2011
CMPUT 675 : Approximation Algorithms Fall 2011 Lecture 18 ( November 8 ) : Euclidean TSP
Euclidean TSP is a subset of Travelling Salesman Problem in which distances are on Euclidean plane, i.e. the instances are on R 2… Expand
  • figure 18.1
  • figure 18.2
  • figure 18.3
  • figure 18.4
  • figure 18.5
Is this relevant?
2009
2009
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
We give a systematic study of Hamiltonicity of grids - the graphs induced by finite subsets of vertices of the tilings of the… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Traveling Salesperson Problems for the Dubins Vehicle
In this paper, we study minimum-time motion planning and routing problems for the Dubins vehicle, i.e., a nonholonomic vehicle… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2007
2007
Behavioural Impacts of Mobile Tour Guides
Electronic tour guides have been developed to personalise guided tours. Also, in contrast to traditional tours, electronic tour… Expand
  • figure 1
  • table 1
  • figure 3
  • figure 4
  • table 2
Is this relevant?
2003
2003
Algorithms: A Top-Down Approach
The current draft and supplemental materials for the text, 'Algorithms: A Top-Down Approach', by Rodney R. Howell 
Is this relevant?
2002
2002
New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem
Given an undirected edge-weighted graph and a depot node, postman problems are generally concerned with traversing the edges of… Expand
Is this relevant?
1996
1996
L'art à l'épreuve du concept
Ce livre propose un examen critique de la maniere dont la question de la definition de l'art a ete abordee par l'esthetique… Expand
Is this relevant?
1996
1996
Guaranteeing full fault coverage for UIO-based testing methods
This paper presents an analysis of the fault coverage provided by the UIO-based methods for testing communications protocols… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1992
1992
Tour automatique multibroche
Ce tour automatique multibroche possede au moins deux ensembles broches porte-pieces (18, 20) se deplacant dans les sens X et Z… Expand
Is this relevant?