6 Hits in 4.4 sec

Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems *

Fedor Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
In this paper, we give the first subexponential time algorithms for both problems.  ...  In the Rectilinear Steiner Tree problem, input is a set T of n points in the Euclidean plane (R 2) and the goal is to find an rectilinear Steiner tree for T of smallest possible total length.  ...  S o C G 2 0 1 6 39:8 Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems Observation 13.  ... 

Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221)

Jeff Erickson, Philip N. Klein, Dániel Marx, Claire Mathieu, Marc Herbstritt
2016 Dagstuhl Reports  
This report documents the program and the outcomes of Dagstuhl Seminar 16221 "Algorithms for Optimization Problems in Planar Graphs". The seminar was held from May 29 to June 3, 2016.  ...  This report contains abstracts for the recent developments in planar graph algorithms discussed during the seminar as well as summaries of open problems in this area of research.  ...  Subexponential algorithms for rectilinear Steiner tree and arborescence problems Saket Saurabh (The Institute of Mathematical Sciences, IN) License Creative Commons BY 3.0 Unported license © Saket  ... 
doi:10.4230/dagrep.6.5.94 dblp:journals/dagstuhl-reports/EricksonKMM16 fatcat:wasdfgivt5fqdppfxo3iqqs2ta

Parameterized Approximation Algorithms for k-Center Clustering and Variants [article]

Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi
2021 arXiv   pre-print
We design a 2^O(klog k)n^2 time 3-approximation for NUkC in general metrics, and a 2^O((klog k)/ϵ)dn time (1+ϵ)-approximation for Euclidean NUkC. The latter time bound matches the bound for k-center.  ...  We give a faster algorithm for small dimensions: roughly speaking an O^*(2^O((1/ϵ)^O(d)· k^1-1/d·log k))-time (1+ϵ)-approximation.  ...  Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, and Saket Saurabh. Subexponential algorithms for rectilinear steiner tree and arborescence problems. ACM Trans.  ... 
arXiv:2112.10195v1 fatcat:ea6v36z2ijfijilkjtnzmwxbze

Page 1475 of Mathematical Reviews Vol. 28, Issue Index [page]

Mathematical Reviews  
., 96d:05009 Gartner, Bernd A subexponential algorithm for abstract optimization problems. (English summary) 96m:68067 Gasarch, William I. (with Krentel, M. W.; Rappoport, K. J.)  ...  On-line and dynamic algorithms for shortest path problems. (English summary) 96i:05158 — see also Aleksandrov, Liudmil G., 96m:05058 Dobrindt, Katrin T.  ... 

14th International Symposium on Mathematical Programming

1990 Mathematical programming  
It is shown that for the success of the variant dom must ful ll a regularity property and that the choice of the normal vectors must meet some demands.Both requirements are ful lled if dom is polyhedral  ...  Finally I report numerical results of a comparison between the variant and a minimization approach using penalty functions.  ...  salesman problem, quadratic assignment problems and Steiner tree problems.  ... 
doi:10.1007/bf01580875 fatcat:3jtclwmntzgjxkqs5uecombdaa

Dagstuhl Reports, Volume 6, Issue 5, May 2016, Complete Issue [article]

This talk overviews one possible path of implementing moral reasoning for machines as reasoning with default.  ...  reasons and desires, what are the relations between reasons and values, and can reasons be objective.  ...  Subexponential algorithms for rectilinear Steiner tree and arborescence problems Saket Saurabh . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .  ... 
doi:10.4230/dagrep.6.5 fatcat:inw7y622xfac5mhgookw2wylme