Accelerating Computation of Steiner Trees on GPUs

Author(s):  
Rajesh Pandian Muniasamy ◽  
Rupesh Nasre ◽  
N. S. Narayanaswamy
Keyword(s):  
Author(s):  
Alessandro Hill ◽  
Roberto Baldacci ◽  
Stefan Voß
Keyword(s):  

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
François Dayrens ◽  
Simon Masnou ◽  
Matteo Novaga ◽  
Marco Pozzetta

AbstractWe introduce a notion of connected perimeter for planar sets defined as the lower semicontinuous envelope of perimeters of approximating sets which are measure-theoretically connected. A companion notion of simply connected perimeter is also studied. We prove a representation formula which links the connected perimeter, the classical perimeter, and the length of suitable Steiner trees. We also discuss the application of this notion to the existence of solutions to a nonlocal minimization problem with connectedness constraint.


1992 ◽  
Vol 42 (3) ◽  
pp. 151-152
Author(s):  
J.S. Salowe
Keyword(s):  

2004 ◽  
Vol 1 (9) ◽  
pp. 258-262
Author(s):  
Hector Cancela ◽  
Franco Robledo ◽  
Gerardo Rubino
Keyword(s):  

1996 ◽  
Vol 72 (2) ◽  
pp. 101-123 ◽  
Author(s):  
M. Grötschel ◽  
A. Martin ◽  
R. Weismantel
Keyword(s):  

2015 ◽  
Vol 32 (4) ◽  
pp. 1089-1106 ◽  
Author(s):  
Dimitri Watel ◽  
Marc-Antoine Weisser ◽  
Cédric Bentz ◽  
Dominique Barth
Keyword(s):  

Author(s):  
R. Condamoor ◽  
I.G. Tollis
Keyword(s):  

1981 ◽  
Vol 11 (3) ◽  
Author(s):  
F.R.K. Chung ◽  
R.L. Graham
Keyword(s):  

Networks ◽  
1990 ◽  
Vol 20 (1) ◽  
pp. 109-120 ◽  
Author(s):  
Marshall Bern

1979 ◽  
Vol 4 (1) ◽  
pp. 15-36 ◽  
Author(s):  
J. MACGREGOR SMITH ◽  
JUDITH S. LIEBMAN

Sign in / Sign up

Export Citation Format

Share Document