Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Happy ending problem"'
Autor:
Frederic Green
Publikováno v:
ACM SIGACT News. 51:15-17
In 1930, the mathematician Esther Klein observed that any five points in the plane in general position (i.e., no three points forming a line) contain four points forming a convex quadrilateral. This innocentsounding discovery led to major lines of re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b37352fdf9b5461d00d8c308f23ff11c
https://doi.org/10.1145/3444815.3444820
https://doi.org/10.1145/3444815.3444820
Autor:
I. V. Urazova, R. Yu. Simanchev
Publikováno v:
Journal of Applied and Industrial Mathematics. 9:283-291
We study the polytope of the graph approximation problem. Some polyhedral relaxation of this polytope is built. We describe the class of valid inequalities for this polytope among which the inequalities that generate the facets are allocated.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5dd8daa2630f7966a77e0c303d4ffe71
https://doi.org/10.1134/s1990478915020143
https://doi.org/10.1134/s1990478915020143
Autor:
M. A. Kozachok, A. N. Magazinov
Publikováno v:
Modelirovanie i Analiz Informacionnyh Sistem, Vol 21, Iss 4, Pp 47-53 (2014)
A perfect prismatoid is a convex polytope P such that for every its facet F there exists a supporting hyperplane α k F such that any vertex of P belongs to either F or α. Perfect prismatoids concern with Kalai conjecture, that any centrally symmetr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a40bcfdc6b977d4326bc6b12498921a
https://www.mais-journal.ru/jour/article/view/97
https://www.mais-journal.ru/jour/article/view/97
Autor:
Victor Alvarez
Publikováno v:
Graphs and Combinatorics. 31:35-57
Let $${P\subset\mathbb{R}^{2}}$$ P ? R 2 be a set of n points, of which k lie in the interior of the convex hull CH(P) of P. Let us call a triangulation T of P even (odd) if and only if all its vertices have even (odd) degree, and pseudo-even (pseudo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::386a5a54e554790963399dc9b4959156
https://doi.org/10.1007/s00373-013-1389-6
https://doi.org/10.1007/s00373-013-1389-6
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.
Autor:
Florian Strunk
Publikováno v:
Discrete & Computational Geometry. 49:183-188
We use a projective transformation method of Toth and Valtr to show that a certain number of points in general position in the plane contain the vertex set of a convex $$n$$-gon if their convex hull is an $$(n\!-\!1)$$-gon.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4d3c890bb3510a07713d55c2e976bcb
https://doi.org/10.1007/s00454-012-9474-9
https://doi.org/10.1007/s00454-012-9474-9
Autor:
Pedro Miranda, Elías F. Combarro
Publikováno v:
Fuzzy Sets and Systems. 159:2145-2162
In this paper we deal with the problem of studying the structure of the polytope of non-additive measures for finite referential sets. We give a necessary and sufficient condition for two extreme points of this polytope to be adjacent. We also show t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5599f2999d5a83b3c78805d4d8707ae7
https://doi.org/10.1016/j.fss.2007.12.021
https://doi.org/10.1016/j.fss.2007.12.021
Publikováno v:
Optimization. 55:311-339
We consider the k-cycle polytope which is the convex hull of the incidence vectors of simple cycles of fixed length k in a complete undirected graph. We summarize the previous results of Kovalev, Maurras, Nguyen and Vaxes (Maurras, J.-F., Kovalev, M.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b4ac5649d0592ab5ee10b1592ff903d
https://doi.org/10.1080/02331930600711976
https://doi.org/10.1080/02331930600711976
Autor:
Kevin K. H. Cheung
Publikováno v:
Discrete Optimization. 3:111-122
Cunningham and Geelen introduced the independent path-matching problem as a common generalization of the weighted matching problem and the weighted matroid intersection problem. Associated with an independent path-matching is an independent path-matc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43996739d232be1ae6e1012e44cd283f
https://doi.org/10.1016/j.disopt.2006.01.001
https://doi.org/10.1016/j.disopt.2006.01.001
Autor:
Rom Pinchasi, Shmuel Onn
Publikováno v:
Journal of Combinatorial Theory, Series A. 107:147-151
We show that the minimum number of distinct edge-directions of a convex polytope with n vertices in Rd is θ(dn1/(d−1)).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89b8ca607af07ed5ce0e4fb1d2155998
https://doi.org/10.1016/j.jcta.2004.03.008
https://doi.org/10.1016/j.jcta.2004.03.008