標題: Titlebook: Combinatorial Optimization and Applications; 9th International Co Zaixin Lu,Donghyun Kim,Ding-Zhu Du Conference proceedings 2015 Springer I [打印本頁] 作者: Encounter 時間: 2025-3-21 16:49
書目名稱Combinatorial Optimization and Applications影響因子(影響力)
書目名稱Combinatorial Optimization and Applications影響因子(影響力)學科排名
書目名稱Combinatorial Optimization and Applications網絡公開度
書目名稱Combinatorial Optimization and Applications網絡公開度學科排名
書目名稱Combinatorial Optimization and Applications被引頻次
書目名稱Combinatorial Optimization and Applications被引頻次學科排名
書目名稱Combinatorial Optimization and Applications年度引用
書目名稱Combinatorial Optimization and Applications年度引用學科排名
書目名稱Combinatorial Optimization and Applications讀者反饋
書目名稱Combinatorial Optimization and Applications讀者反饋學科排名
作者: AER 時間: 2025-3-22 00:16
978-3-319-26625-1Springer International Publishing Switzerland 2015作者: 負擔 時間: 2025-3-22 03:41
The Discrete and Mixed Minimax 2-Center Problemmum of two terms, namely, the Euclidean distance between two centers and the distance of any other point to the closer center. The mixed minimax 2-center problem (.2.) is when one of the two centers is not in .. We present algorithms for solving the .2. and .2.. The time complexity of solving .2. and .2. are . and . respectively.作者: 我怕被刺穿 時間: 2025-3-22 06:38
Conference proceedings 2015 Houston, TX, USA, in December 2015. The 59 full papers included in the book were carefully reviewed and selected from 125 submissions. Topics covered include classic combinatorial optimization; geometric optimization; network optimization;?applied optimization;?complexity and game; and optimization in graphs.作者: Dorsal-Kyphosis 時間: 2025-3-22 11:23
Combinatorial Optimization and Applications978-3-319-26626-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: ATRIA 時間: 2025-3-22 15:45
Intelligent Devices Used in Healthcaremum of two terms, namely, the Euclidean distance between two centers and the distance of any other point to the closer center. The mixed minimax 2-center problem (.2.) is when one of the two centers is not in .. We present algorithms for solving the .2. and .2.. The time complexity of solving .2. and .2. are . and . respectively.作者: ATRIA 時間: 2025-3-22 17:45
Zaixin Lu,Donghyun Kim,Ding-Zhu DuIncludes supplementary material: 作者: 北極人 時間: 2025-3-22 23:26
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229982.jpg作者: Feigned 時間: 2025-3-23 02:25 作者: Vasoconstrictor 時間: 2025-3-23 06:20 作者: 剛毅 時間: 2025-3-23 11:32 作者: aneurysm 時間: 2025-3-23 17:42
https://doi.org/10.1007/978-981-15-2837-8 bin the colors of items must alternate. The problem has been studied extensively, but the best competitive online algorithm has competitiveness of 3. The competitiveness of 3 can be forced even when the sizes of items are ‘halved’, i.e.?the sizes are restricted to be in (0,?1?/?2]. We give the firs作者: expeditious 時間: 2025-3-23 20:33 作者: inflame 時間: 2025-3-23 22:43
Cyber Situational Awareness Frontierstion and facility cost is minimized. The connection cost is proportional to the distance between each client and its assigned facility, whereas the facility cost is a nondecreasing function with respect to the total number of clients assigned to the facility. The universal facility location problem 作者: companion 時間: 2025-3-24 04:56 作者: pulse-pressure 時間: 2025-3-24 07:13
Intelligent Devices Used in Healthcaremum of two terms, namely, the Euclidean distance between two centers and the distance of any other point to the closer center. The mixed minimax 2-center problem (.2.) is when one of the two centers is not in .. We present algorithms for solving the .2. and .2.. The time complexity of solving .2. an作者: indecipherable 時間: 2025-3-24 13:22
https://doi.org/10.1007/978-3-031-56533-5 given a set of points inside the integer grid (in Euclidean plane) where each grid cell is .. In the MST version of the problem, the goal is to find a minimum tree that contains exactly one point from each non-empty grid cell (cluster). Similarly, in the TSP version of the problem, the goal is to f作者: 槍支 時間: 2025-3-24 16:53
Richa Gupta,Saima Majid,Mohini Yadavecting an ., or equivalently a .. We prove that for axis-parallel unit squares the hitting set and set cover problems are .-complete, whereas the piercing set and independent set problems are in .. For axis-parallel rectangles, we prove that the piercing set problem is .-complete, which solves an op作者: giggle 時間: 2025-3-24 19:13 作者: FUME 時間: 2025-3-25 01:15
Andreas Meier,Hans-Dieter Zimmermannnt to find a minimum-size set . of line segments such that every cell in the arrangement has a line from . defining its boundary. We show that the problem is NP-hard, even when all segments are axis-aligned. In fact, the problem is still NP-hard when we only need to cover rectangular cells of the ar作者: OTHER 時間: 2025-3-25 04:09 作者: Duodenitis 時間: 2025-3-25 10:47 作者: Obliterate 時間: 2025-3-25 15:14
Intelligentes Leben in der Stadt der Zukunfts of a given . are influenced; subsequently, at each round, the set of influenced nodes is augmented by all the nodes in the network that have a sufficiently large number of already influenced neighbors. The question is to determine a small subset of nodes . (.) that can influence the whole network.作者: Affable 時間: 2025-3-25 17:17 作者: Ascribe 時間: 2025-3-25 22:28 作者: 抗生素 時間: 2025-3-26 03:39 作者: babble 時間: 2025-3-26 07:48
Cyber Brittleness of Smart Cities time, one can derive polynomial algorithms for the problem, provided the cost function is monotonic or periodic. Finally, as an observation, we mention how polynomial time algorithms can be adapted with the objective of minimizing maximum lateness.作者: 牽索 時間: 2025-3-26 11:22
Richa Gupta,Saima Majid,Mohini Yadavem with axis-parallel squares, where . is the number of squares and side lengths of the squares vary from 1 to .. We also prove that when the given objects are unit-height rectangles, both the hitting set and set cover problems are .-complete. For the same set of objects, we prove that the independent set problem can be solved in polynomial time.作者: 擁擠前 時間: 2025-3-26 13:18 作者: comely 時間: 2025-3-26 18:48
Directed Pathwidth and Palletizerstroduce a graph model for this problem, the so called sequence graph, which allows us to show that there is a processing of some list of sequences with at most . stack-up places if and only if the sequence graph of this list has directed pathwidth at most ..作者: 吸引人的花招 時間: 2025-3-26 23:40 作者: ACRID 時間: 2025-3-27 04:06 作者: fastness 時間: 2025-3-27 06:56
Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Lineem with axis-parallel squares, where . is the number of squares and side lengths of the squares vary from 1 to .. We also prove that when the given objects are unit-height rectangles, both the hitting set and set cover problems are .-complete. For the same set of objects, we prove that the independent set problem can be solved in polynomial time.作者: 原諒 時間: 2025-3-27 13:18 作者: 易碎 時間: 2025-3-27 16:09 作者: PANIC 時間: 2025-3-27 18:34 作者: Homocystinuria 時間: 2025-3-27 21:58
Improved Algorithms for the Evacuation Route Planning Problemd algorithm ., whose evacuation time is always at most that of a famous algorithm ., and whose running time is strictly less than that of CCRP. We prove this mathematically and give supporting results by extensive experiments. We also study randomized behavior model of people and give some interesting results.作者: Receive 時間: 2025-3-28 04:55 作者: photophobia 時間: 2025-3-28 08:20
Optimal Self-assembly of Finite Shapes at Temperature 1 in 3D “just barely” 3D in the sense that it only places tiles in the . and . planes. Our result is essentially a just-barely 3D temperature 1 simulation of a similar 2D temperature 2 result by Soloveichik and Winfree (SICOMP 2007).作者: diathermy 時間: 2025-3-28 10:27
Line Segment Covering of Cells in Arrangementsrangement. For the latter problem we also show that it is fixed parameter tractable with respect to the size of the optimal solution. Finally we provide a linear time algorithm for the case where cells of the arrangement are created by recursively subdividing a rectangle using horizontal and vertical cutting segments.作者: 乏味 時間: 2025-3-28 16:19
An Improved On-line Strategy for Exploring Unknown Polygonstrategy is an on-line implementation of a previously known off-line algorithm that approximates the optimum watchman route to a factor of .. The other is in the way the polygon exploration problem is decomposed into two different types of the subproblems and a new method for analyzing its cost performance.作者: 的是兄弟 時間: 2025-3-28 20:49 作者: 慌張 時間: 2025-3-28 23:45 作者: paroxysm 時間: 2025-3-29 06:51 作者: GROVE 時間: 2025-3-29 10:14 作者: Basilar-Artery 時間: 2025-3-29 11:23
Digitales Entwicklungsmodell smarter St?dtee, it can be approximated well in such a special case. For instance, in the Euclidean plane, the problem (and it’s several modifications) have polynomial time approximation schemes (PTAS). We propose polynomial time approximation scheme for the case of ..作者: 不愿 時間: 2025-3-29 18:59 作者: FLAG 時間: 2025-3-29 20:47
Black and White Bin Packing Revisited The competitiveness of 3 can be forced even when the sizes of items are ‘halved’, i.e.?the sizes are restricted to be in (0,?1?/?2]. We give the first ‘better than 3’ competitive algorithm for the problem for the case that item sizes are in the range (0,?1?/?2]; our algorithm has competitiveness ..作者: ALERT 時間: 2025-3-30 02:41 作者: crockery 時間: 2025-3-30 06:45 作者: surmount 時間: 2025-3-30 08:30
Conference proceedings 2015 Houston, TX, USA, in December 2015. The 59 full papers included in the book were carefully reviewed and selected from 125 submissions. Topics covered include classic combinatorial optimization; geometric optimization; network optimization;?applied optimization;?complexity and game; and optimization作者: 發(fā)電機 時間: 2025-3-30 14:52 作者: MERIT 時間: 2025-3-30 19:06 作者: 臆斷 時間: 2025-3-31 00:08
Andreas Meier,Hans-Dieter Zimmermannrangement. For the latter problem we also show that it is fixed parameter tractable with respect to the size of the optimal solution. Finally we provide a linear time algorithm for the case where cells of the arrangement are created by recursively subdividing a rectangle using horizontal and vertical cutting segments.作者: 豐滿中國 時間: 2025-3-31 02:18 作者: Mere僅僅 時間: 2025-3-31 06:50
