Packing Element-Disjoint Steiner Trees

Lecture Notes in Computer Science - Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques ◽

10.1007/11538462_5 ◽

2005 ◽

pp. 52-61 ◽

Cited By ~ 2

Author(s):

Joseph Cheriyan ◽

Mohammad R. Salavatipour

Keyword(s):

Steiner Trees ◽

Packing Element

Download Full-text

Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes

Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-319-07956-1_10 ◽

2014 ◽

pp. 100-111

Author(s):

Daiki Hoshika ◽

Eiji Miyano

Keyword(s):

Approximation Algorithms ◽

Steiner Trees ◽

Packing Element

Download Full-text

Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs

Algorithmica ◽

10.1007/s00453-011-9540-3 ◽

2011 ◽

Vol 63 (1-2) ◽

pp. 425-456 ◽

Cited By ~ 5

Author(s):

A. Aazami ◽

J. Cheriyan ◽

K. R. Jampani

Keyword(s):

Approximation Algorithms ◽

Planar Graphs ◽

Steiner Trees ◽

Packing Element

Download Full-text

Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e99.a.1059 ◽

2016 ◽

Vol E99.A (6) ◽

pp. 1059-1066

Author(s):

Daiki HOSHIKA ◽

Eiji MIYANO

Keyword(s):

Approximation Algorithms ◽

Steiner Trees ◽

Packing Element

Download Full-text

Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03685-9_1 ◽

2009 ◽

pp. 1-14 ◽

Cited By ~ 1

Author(s):

Ashkan Aazami ◽

Joseph Cheriyan ◽

Krishnam Raju Jampani

Keyword(s):

Approximation Algorithms ◽

Planar Graphs ◽

Steiner Trees ◽

Packing Element

Download Full-text

Packing element-disjoint steiner trees

ACM Transactions on Algorithms ◽

10.1145/1290672.1290684 ◽

2007 ◽

Vol 3 (4) ◽

pp. 47 ◽

Cited By ~ 11

Author(s):

Joseph Cheriyan ◽

Mohammad R. Salavatipour

Keyword(s):

Steiner Trees ◽

Packing Element

Download Full-text

Optimal Steiner trees under node and edge privacy conflicts

Journal of Combinatorial Optimization ◽

10.1007/s10878-020-00690-1 ◽

2021 ◽

Author(s):

Alessandro Hill ◽

Roberto Baldacci ◽

Stefan Voß

Keyword(s):

Steiner Trees

Download Full-text

Connected perimeter of planar sets

Advances in Calculus of Variations ◽

10.1515/acv-2019-0050 ◽

2020 ◽

Vol 0 (0) ◽

Author(s):

François Dayrens ◽

Simon Masnou ◽

Matteo Novaga ◽

Marco Pozzetta

Keyword(s):

Minimization Problem ◽

Existence Of Solutions ◽

Lower Semicontinuous ◽

Representation Formula ◽

Steiner Trees ◽

Lower Semicontinuous Envelope ◽

Simply Connected

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.

Download Full-text