Sciweavers

150 search results - page 1 / 30
» Traversing a set of points with a minimum number of turns
Sort
View
COMPGEOM
2007
ACM
13 years 7 months ago
Traversing a set of points with a minimum number of turns
Given a finite set of points S in Rd , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number o...
Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, F...
IPCO
2001
184views Optimization» more  IPCO 2001»
13 years 5 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
13 years 7 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos
SIAMDM
2008
110views more  SIAMDM 2008»
13 years 3 months ago
The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane
We prove a conjecture of Erdos, Purdy, and Straus on the number of distinct areas of triangles determined by a set of n points in the plane. We show that if P is a set of n points...
Rom Pinchasi
DM
2002
116views more  DM 2002»
13 years 3 months ago
Star forests, dominating sets and Ramsey-type problems
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary ...