독일 일반 면세 구매대행
임시 중단 안내
안녕하세요. 오마이집입니다.
더 나은 서비스를 위해
독일 일반 면세 구매대행 서비스를 임시 중단합니다.
새로운 모습으로 빠른 시일 내 다시 인사드리겠습니다.
감사합니다.
US
DE
498 Centerpoint Blvd
[사서함번호]
New Castle, DE, 19720
302-322-8792
* 항공운송만 가능
US
CA
2601 Walnut Ave
[사서함번호]
Tustin, CA, 92780
714-676-7274
* 해상운송만 가능
China
山东省威海市 环翠区 苘山镇
福州路9号 顺丰速递北20米
[사서함번호]
264414
156-8451-3564
* 항공&해상운송 가능
Germany
WarpEx [사서함번호]
Carl-Benz Str. 35
Frankfurt am Main, Hessen, Deutschland
60386
0614-2482-9236
* 항공운송만 가능
Korea
서울시 강서구 마곡중앙6로 11 보타닉파크타워3 405호
[사서함번호]
07801
070-5228-2983
Japan
福岡県 福岡市東区
和白東1丁目16-15 HANIRO
[사서함번호]
811-0214
092-608-7642
* 해상운송만 가능
고객센터 알림
NO | 안내시간 | 수취인명 | 신청서번호 | 알림내용 |
---|
* 알림 내용을 클릭하면 해당 페이지로 이동합니다.
Delaware
$14.50
책 정보
출판사 | Books on Demand |
---|---|
저자 | Jan Hendrik Rolfes |
판형 | Paperback |
ISBN-10 | 375434675X |
ISBN-13 | 9783754346754 |
발행일 | 2021/09/15 |
언어 | ger |
무게 (LB) | 0.53 |
주제 분류
책 소개
The present thesis is a commencement of a generalization of covering results in specific settings, such as the Euclidean space or the sphere, to arbitrary compact metric spaces. In particular we consider coverings of compact metric spaces $(X, d)$ by balls of radius $r$. We are interested in the minimum number of such balls needed to cover $X$, denoted by $\Ncal(X, r)$. For finite $X$ this problem coincides with an instance of the combinatorial \textsc{set cover} problem, which is $\mathrm{NP}$-complete. We illustrate approximation techniques based on the moment method of Lasserre for finite graphs and generalize these techniques to compact metric spaces $X$ to obtain upper and lower bounds for $\Ncal(X, r)$. \\ The upper bounds in this thesis follow from the application of a greedy algorithm on the space $X$. Its approximation quality is obtained by a generalization of the analysis of Chv\'atal's algorithm for the weighted case of \textsc{set cover}. We apply this greedy algorithm to the spherical case $X=S^n$ and retrieve the best non-asymptotic bound of B\"or\"oczky and Wintsche. Additionally, the algorithm can be used to determine coverings of Euclidean space with arbitrary measurable objects having non-empty interior. The quality of these coverings slightly improves a bound of Nasz\'odi. \\ For the lower bounds we develop a sequence of bounds $\Ncal^t(X, r)$ that converge after finitely (say $\alpha\in\N$) many steps: $$\Ncal^1(X, r)\leq \ldots \leq \Ncal^\alpha(X, r)=\Ncal(X, r).$$ The drawback of this sequence is that the bounds $\Ncal^t(X, r)$ are increasingly difficult to compute, since they are the objective values of infinite-dimensional conic programs whose number of constraints and dimension of underlying cones grow accordingly to $t$. We show that these programs satisfy strong duality and derive a finite dimensional semidefinite program to approximate $\Ncal^2(S^2, r)$ to arbitrary precision. Our results rely in part on the moment methods developed by de Laat a
트래킹 도착 조회
조회
조회 결과가 없는 경우, 센터로 상품이 도착하지 않은 것이니 판매처로 문의해주시기 바랍니다.
배송신청서에 이미 입고처리가 된 건이나 미작성 입고로 안내된 건은 조회가 되지 않습니다.