×

Found 154 Documents (Results 1–100)

Steiner problem in the Gromov-Hausdorff space: the case of finite metric spaces. (English. Russian original) Zbl 1432.54028

Proc. Steklov Inst. Math. 304, Suppl. 1, S88-S96 (2019); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 23, No. 4, 152-161 (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Bifurcations of Steiner minimal trees and minimal fillings for non-convex four-point boundaries and Steiner subratio for the Euclidean plane. (English. Russian original) Zbl 1343.51003

Mosc. Univ. Math. Bull. 71, No. 2, 79-81 (2016); translation from Vestn. Mosk. Univ., Ser. I 71, No. 2, 48-51 (2016).
MSC:  51E10
PDFBibTeX XMLCite
Full Text: DOI

Minimal fillings of finite metric spaces: The state of the art. (English) Zbl 1331.05071

Barg, Alexander (ed.) et al., Discrete geometry and algebraic combinatorics. AMS special session on discrete geometry and algebraic combinatorics, San Diego, CA, USA, January 11, 2013. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-0905-0/pbk; 978-1-4704-1949-3/ebook). Contemporary Mathematics 625, 9-35 (2014).
PDFBibTeX XMLCite

Immersed polygons and their diagonal triangulations. (English. Russian original) Zbl 1178.05034

Izv. Math. 72, No. 1, 63-90 (2008); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 72, No. 1, 67-98 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Shortest networks in 2 and 3 dimensions. (English) Zbl 1101.05026

Hoffman, David (ed.), Global theory of minimal surfaces. Proceedings of the Clay Mathematics Institute 2001 summer school, Berkeley, CA, USA, June 25–July 27, 2001. Providence, RI: American Mathematical Society (AMS). Cambridge, MA: Clay Mathematics Institute (ISBN 0-8218-3587-4/pbk). Clay Mathematics Proceedings 2, 783-790 (2005).
PDFBibTeX XMLCite

Geometric optimization problems for Steiner minimal trees in \(E^3\). (English) Zbl 0973.90067

Pardalos, Panos M. (ed.), Approximation and complexity in numerical optimization. Continuous and discrete problems. Conference, Univ. of Florida, Orlando, FL, USA, February 28 - March 2, 1999. Dordrecht: Kluwer Academic Publishers. Nonconvex Optim. Appl. 42, 446-476 (2000).
MSC:  90C27 90B10
PDFBibTeX XMLCite

The Steiner ratio of finite-dimensional \(L_p\)-spaces. (English) Zbl 0957.46010

Butzer, P. L. (ed.) et al., Karl der Grosse und sein Nachwirken. 1200 Jahre Kultur und Wissenschaft in Europa. Band 2: Mathematisches Wissen. Turnhout: Brepols. 353-360 (1998).
MSC:  46B20 46B07 05C05
PDFBibTeX XMLCite

A new exact algorithm for rectilinear Steiner trees. (English) Zbl 0903.90175

Pardalos, Panos M. (ed.) et al., Network design: connectivity and facilities location. DIMACS workshop, April 28–30, 1997. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 357-395 (1998).
PDFBibTeX XMLCite

Using Hadwiger numbers in network design. (English) Zbl 0915.05044

Pardalos, Panos M. (ed.) et al., Network design: connectivity and facilities location. DIMACS workshop, April 28–30, 1997. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 59-77 (1998).
MSC:  05C05 52A21 90B18
PDFBibTeX XMLCite

The Steiner tree problem for terminals on the boundary of a rectilinear polygon. (English) Zbl 0896.68106

Pardalos, Panos M. (ed.) et al., Network design: connectivity and facilities location. DIMACS workshop, April 28–30, 1997. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 39-57 (1998).
MSC:  68R10
PDFBibTeX XMLCite

Gradient-constrained minimal Steiner trees. (English) Zbl 0915.05042

Pardalos, Panos M. (ed.) et al., Network design: connectivity and facilities location. DIMACS workshop, April 28–30, 1997. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 23-38 (1998).
MSC:  05C05 68R10
PDFBibTeX XMLCite

The geometry of minimal networks with a given topology and a fixed boundary. (English. Russian original) Zbl 0906.05016

Izv. Math. 61, No. 6, 1231-1263 (1997); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 61, No. 6, 119-152 (1997).
PDFBibTeX XMLCite
Full Text: DOI

A new way to weigh malnourished Euclidean graphs. (English) Zbl 0849.68090

Clarkson, K. (ed.), Proceedings of the 6th annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 22-24, 1995. Philadelphia, PA: SIAM. 215-222 (1995).
MSC:  68R10 68U05 68Q25
PDFBibTeX XMLCite

Rectilinear Steiner tree minimization on a workstation. (English) Zbl 0814.68054

Dean, Nathaniel (ed.) et al., Computational support for discrete mathematics. DIMACS workshop March 12-14, 1992. Papers based on talks given at the DIMACS workshop held at Rutgers University, Piscataway, NJ, USA. Providence, RI: American Mathematical Society, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 15, 119-136 (1994).
PDFBibTeX XMLCite

On optimal network with quasi-full Steiner topology. (English) Zbl 0832.05028

Yap, H. P. (ed.) et al., Combinatorics and graph theory. Proceedings of the spring school and international conference on combinatorics, held in Hefei, China, 6-27 April 1992. Singapore: World Scientific. 216-228 (1993).
MSC:  05C05 05C85 68R10
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field