Set TSP problem

Known as: Set TSP, Group TSP, One-of-a-Set TSP 
In combinatorial optimization, the set TSP, also known as the, generalized TSP, group TSP, One-of-a-Set TSP, Multiple Choice TSP or Covering Salesman… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1989-2017
051019892017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Wireless sensor network (WSN) applications usually demand a time-synchronization protocol for node coordination and data… (More)
  • table I
  • figure 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Accurately synchronized clocks are crucial for many applications in sensor networks. Existing time synchronization algorithms… (More)
Is this relevant?
2005
2005
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2003
2003
In the Generalized Traveling Salesman Problem (GTSP), given a weighted complete digraph D and a partition V1, . . . , Vk of the… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We prove that various geometric covering problems related to the Traveling Salesman Problem cannot be efficiently approximated to… (More)
  • table 1.1
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We give the first non-trivial approximation algorithms for the Steiner tree problem and the generalized Steiner network problem… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Symmetri Generalized Travelling Salesman Problem Matteo Fis hetti Juan Jos e Salazar Gonz alezy Paolo Tothz January 1994; Revised… (More)
  • figure 4.1
  • figure 4.2
  • figure 4.3
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Red-Blue Separation Problem (RBSP): Consider the problem of finding a minimum-perimeter Jordan curve (necessarily, a simple… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We introduce a geometric version of the Covering Salesman Problem: Each of the n salesman's clients speciies a neighborhood in… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
 
Is this relevant?