Sciweavers

Share
ICALP
2011
Springer
9 years 3 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
TCS
2010
9 years 10 months ago
Euclidean TSP on two polygons
We give an O(n2 m + nm2 + m2 log m) time and O(n2 + m2 ) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles i...
Jeff Abrahamson, Ali Shokoufandeh
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
9 years 11 months ago
Even Astral Configurations
A configuration (pq, nk) is a collection of p points and n straight lines in the Euclidean plane so that every point has q straight lines passing through it and every line has k p...
Leah Wrenn Berman
CORR
2007
Springer
74views Education» more  CORR 2007»
9 years 11 months ago
Periodicity of certain piecewise affine planar maps
We determine periodic and aperiodic points of certain piecewise affine maps in the Euclidean plane. Using these maps, we prove for λ ∈ { ±1± √ 5 2 , ± √ 2, ± √ 3} that...
Shigeki Akiyama, Horst Brunotte, Attila Pethö...
COMBINATORICS
2006
94views more  COMBINATORICS 2006»
9 years 11 months ago
Some Results on Odd Astral Configurations
An astral configuration (pq, nk) is a collection of p points and n straight lines in the Euclidean plane where every point has q straight lines passing through it and every line h...
Leah Wrenn Berman
IPCO
2001
184views Optimization» more  IPCO 2001»
10 years 1 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
COMPGEOM
1996
ACM
10 years 3 months ago
On the Number of Arrangements of Pseudolines
Given a simple arrangementof n pseudolines in the Euclidean plane, associate with line i the list i of the lines crossing i in the order of the crossings on line i. i = ( i 1; i 2;...
Stefan Felsner
WG
1998
Springer
10 years 3 months ago
Triangles in Euclidean Arrangements
The number of triangles in arrangements of lines and pseudolines has been object of some research. Most results, however, concern arrangements in the projective plane. In this arti...
Stefan Felsner, Klaus Kriegel
FOCS
2008
IEEE
10 years 6 months ago
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
Glencora Borradaile, Philip N. Klein, Claire Mathi...
books