Zobrazeno 1 - 10
of 4 518
pro vyhledávání: '"Wiegele A"'
In the quadratic minimum spanning tree problem (QMSTP) one wants to find the minimizer of a quadratic function over all possible spanning trees of a graph. We give two formulations of the QMSTP as mixed-integer semidefinite programs exploiting the al
Externí odkaz:
http://arxiv.org/abs/2410.04997
Convexification techniques have gained increasing interest over the past decades. In this work, we apply a recently developed convexification technique for fractional programs by He, Liu and Tawarmalani (2024) to the problem of determining the edge e
Externí odkaz:
http://arxiv.org/abs/2410.02526
Computing the edge expansion of a graph is a famously hard combinatorial problem for which there have been many approximation studies. We present two variants of exact algorithms using semidefinite programming (SDP) to compute this constant for any g
Externí odkaz:
http://arxiv.org/abs/2403.04657
Autor:
Johnson, Gary R., Barner-Barry, Carol, Blank, Robert H., Caldwell, Lynton K., Wahlke, John C.
Publikováno v:
Politics and the Life Sciences, 1992 Feb 01. 11(1), 93-98.
Externí odkaz:
https://www.jstor.org/stable/4235837
Autor:
Johannes Gratz, Stefan Ulbing, Fabian Schäfer, Stefan Koch, Christoph Dibiasi, Marion Wiegele, Peter Quehenberger, Eva Schaden
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-9 (2024)
Abstract Owing to the simultaneous increase in the risk of thrombosis and bleeding in critically ill patients, point-of-care-available diagnostic tests to guide parenteral anticoagulation are warranted. We evaluated the detection of enoxaparin and ar
Externí odkaz:
https://doaj.org/article/d5330f357d154d4aaae5449b4c10ca22
Autor:
Hanks, Patrick, Lenarčič, Simon
Publikováno v:
Dictionary of American Family Names, 2 ed., 2022.
Externí odkaz:
http://www.oxfordreference.com/view/10.1093/acref/9780190245115.001.0001/acref-9780190245115-e-80601
Given a linear ordering of the vertices of a graph, the cutwidth of a vertex $v$ with respect to this ordering is the number of edges from any vertex before $v$ (including $v$) to any vertex after $v$ in this ordering. The cutwidth of an ordering is
Externí odkaz:
http://arxiv.org/abs/2301.03900