Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Swanepoel, K. J."'
Publikováno v:
Networks 61 (2013), 238--247
We investigate the problem of designing a minimum cost flow network interconnecting n sources and a single sink, each with known locations in a normed space and with associated flow demands. The network may contain any finite number of additional unp
Externí odkaz:
http://arxiv.org/abs/0909.4270
Publikováno v:
Proceedings of the World Congress on Engineering 2009 Vol II, WCE 2009, 1-3 July 2009, London, U.K. pp. 1235--1240
We investigate the problem of designing a minimum cost flow network interconnecting n sources and a single sink, each with known locations and flows. The network may contain other unprescribed nodes, known as Steiner points. For concave increasing co
Externí odkaz:
http://arxiv.org/abs/0903.2124
Autor:
Swanepoel, K. J.
Publikováno v:
Discrete & Computational Geometry 21 (1999) 437-447
We find upper bounds for the degrees of vertices and Steiner points in Steiner Minimal Trees in the d-dimensional Banach spaces \ell_p^d independent of d. This is in contrast to Minimal Spanning Trees, where the maximum degree of vertices grows expon
Externí odkaz:
http://arxiv.org/abs/0803.0443
Autor:
Pretorius, L. M., Swanepoel, K. J.
Publikováno v:
Discrete Mathematics 309 (2009), 385--399
Our point of departure is the following simple common generalisation of the Sylvester-Gallai theorem and the Motzkin-Rabin theorem: Let S be a finite set of points in the plane, with each point coloured red or blue or with both colours. Suppose that
Externí odkaz:
http://arxiv.org/abs/math/0606131
Autor:
Pretorius, L. M., Swanepoel, K. J.
The contents of this paper has been incorporated into math.CO/0308288.
Comment: The contents of this paper has been incorporated into math.CO/0308288
Comment: The contents of this paper has been incorporated into math.CO/0308288
Externí odkaz:
http://arxiv.org/abs/math/0309173
Autor:
Pretorius, L. M., Swanepoel, K. J.
Publikováno v:
Ars Combinatoria 80 (2006), 275--315
We classify all finite linear spaces on at most 15 points admitting a blocking set. There are no such spaces on 11 or fewer points, one on 12 points, one on 13 points, two on 14 points, and five on 15 points. The proof makes extensive use of the noti
Externí odkaz:
http://arxiv.org/abs/math/0308288
Autor:
Swanepoel, K. J.
Publikováno v:
Proceedings of the American Mathematical Society, 1996 Aug 01. 124(8), 2513-2518.
Externí odkaz:
https://www.jstor.org/stable/2161639
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.