找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Discrete Geometry and Optimization; Karoly Bezdek,Antoine Deza,Yinyu Ye Book 2013 Springer International Publishing Switzerland 2013 Carat

[复制链接]
楼主: 不幸的你
发表于 2025-3-26 22:17:03 | 显示全部楼层
发表于 2025-3-27 04:39:45 | 显示全部楼层
Fields Institute Communicationshttp://image.papertrans.cn/e/image/281112.jpg
发表于 2025-3-27 05:24:37 | 显示全部楼层
Sándor Csörgő,Rossitza Dodunekovas our goal to demonstrate that still today surprisingly elementary questions (at least from the Euclidean point of view) present parts of the research front in this field. We will discuss incidence theorems, some covering and location problems, group-theoretical aspects, and regularity of figures in
发表于 2025-3-27 09:38:08 | 显示全部楼层
发表于 2025-3-27 13:40:15 | 显示全部楼层
Sun Tzu and the Project Battlegroundinradius one. The conjecture was first stated by L. Fejes Tóth in 1943, and was finally proved by Hales and McLaughlin over 50 years later using techniques developed by Hales for his proof of the Kepler conjecture. In 1964, Fejes Tóth described an approach that would lead to a complete proof of the
发表于 2025-3-27 19:08:57 | 显示全部楼层
Solar Models and Neutrino Problemartitioned into convex cells each containing a unit ball, how should the shapes of the cells be designed to minimize the average edge curvature of the cells? In particular, we prove that the average edge curvature in question is always at least ..
发表于 2025-3-28 01:42:43 | 显示全部楼层
Kory P. Schrom,InYoung Kim,Elma D. Baronthere is a path with at least . edges that is monotone in some direction. This bound is the best possible. Consider now a connected subdivision of the plane into . convex faces where exactly . faces are unbounded. Then, there is a path with at least . edges that is monotone in some direction. This b
发表于 2025-3-28 03:19:12 | 显示全部楼层
Ulrike Leiter,Ulrike Keim,Claus Garbedefinite matrix of rank at most .. We show that this problem is .-hard for any fixed integer . ≥ 2. In other words, for . ≥ 2, it is .-hard to test membership in the rank constrained elliptope ., defined by the set of all partial matrices with an all-ones diagonal and off-diagonal entries specified
发表于 2025-3-28 06:35:41 | 显示全部楼层
发表于 2025-3-28 12:38:42 | 显示全部楼层
Kory P. Schrom,InYoung Kim,Elma D. Baronty constraints. For the inner subproblems, we show that the positive definiteness of the generalized Hessian of the objective function for the inner subproblems is equivalent to the constraint nondegeneracy of the corresponding primal problem, which is a key property for applying a semismooth Newton
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-10 20:14
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表