標(biāo)題: Titlebook: Combinatorial Optimization and Applications; 8th International Co Zhao Zhang,Lidong Wu,Ding-Zhu Du Conference proceedings 2014 Springer Int [打印本頁(yè)] 作者: 開脫 時(shí)間: 2025-3-21 17:50
書目名稱Combinatorial Optimization and Applications影響因子(影響力)
書目名稱Combinatorial Optimization and Applications影響因子(影響力)學(xué)科排名
書目名稱Combinatorial Optimization and Applications網(wǎng)絡(luò)公開度
書目名稱Combinatorial Optimization and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Combinatorial Optimization and Applications被引頻次
書目名稱Combinatorial Optimization and Applications被引頻次學(xué)科排名
書目名稱Combinatorial Optimization and Applications年度引用
書目名稱Combinatorial Optimization and Applications年度引用學(xué)科排名
書目名稱Combinatorial Optimization and Applications讀者反饋
書目名稱Combinatorial Optimization and Applications讀者反饋學(xué)科排名
作者: bioavailability 時(shí)間: 2025-3-21 21:07 作者: EWER 時(shí)間: 2025-3-22 01:34 作者: 預(yù)示 時(shí)間: 2025-3-22 07:59 作者: Nausea 時(shí)間: 2025-3-22 11:50
,Transparent Building Components’ Design,s of .. Each set can be leased for . different periods of time. Let . and .. Leasing a set . for a period . incurs a cost . and allows . to cover its elements for the next . time steps. The objective is to minimize the total cost of the sets leased, such that elements arriving at any time . are cove作者: SPECT 時(shí)間: 2025-3-22 16:26 作者: SPECT 時(shí)間: 2025-3-22 19:05 作者: Offbeat 時(shí)間: 2025-3-22 22:08
Changqing Ji,Yang Gao,Zumin Wang,Jing Qin achieve a bounded ratio of evacuation path length without any boundary information to that with. We restrict the affected area to a convex region in the plane, and present a 19.64-competitive strategy. It can be considered as the planar generalization of the .. Also, we give a 21-competitive strate作者: Vo2-Max 時(shí)間: 2025-3-23 02:33 作者: 分開 時(shí)間: 2025-3-23 07:06 作者: plasma-cells 時(shí)間: 2025-3-23 10:06
Key Technologies on New Energy Vehicles is guarded by . if and only if there exists a point . on . such that line segment . is normal to . and contained in?.. In the minimum sliding cameras (MSC) problem, the objective is to guard . with the minimum number of sliding cameras. We give a linear-time dynamic programming algorithm for the MS作者: 身體萌芽 時(shí)間: 2025-3-23 17:27 作者: 金盤是高原 時(shí)間: 2025-3-23 21:14 作者: lobster 時(shí)間: 2025-3-24 01:26 作者: 弄皺 時(shí)間: 2025-3-24 02:41 作者: 設(shè)施 時(shí)間: 2025-3-24 10:36
https://doi.org/10.1007/978-3-031-52645-9unit ball graph (UBG). MCDS in UBG is proved to be an NP-complete problem, and currently the best approximation is 14.937 in?[.]. However, their projection method during the approximation deduction process is incorrect, which overthrows its final bound completely. As a consequence, in this paper we 作者: pacifist 時(shí)間: 2025-3-24 10:54 作者: sed-rate 時(shí)間: 2025-3-24 18:08
Zhao Zhang,Lidong Wu,Ding-Zhu DuIncludes supplementary material: 作者: 字形刻痕 時(shí)間: 2025-3-24 22:28 作者: comely 時(shí)間: 2025-3-25 02:04
Claudia Steinberger,Judith MichaelWe investigate two kinds of optimization problems regarding points in the 2-dimensional plane that need to be enclosed by squares.作者: GLARE 時(shí)間: 2025-3-25 04:48 作者: indignant 時(shí)間: 2025-3-25 11:04
Combinatorial Optimization and Applications978-3-319-12691-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: AVOW 時(shí)間: 2025-3-25 13:56
Hassan Abdirahman Farah,Arzu Gorgulu Kakisimin a bin of capacity . upon its arrival without any information on the next items, and the goal is to minimize the number of used bins. We present an asymptotic competitive scheme, i.e., for any ., the asymptotic competitive ratio is at most ., where . is the smallest possible asymptotic competitive ratio among all online algorithms.作者: Humble 時(shí)間: 2025-3-25 18:27
Changqing Ji,Yang Gao,Zumin Wang,Jing Qin achieve a bounded ratio of evacuation path length without any boundary information to that with. We restrict the affected area to a convex region in the plane, and present a 19.64-competitive strategy. It can be considered as the planar generalization of the .. Also, we give a 21-competitive strategy in the grid network.作者: sundowning 時(shí)間: 2025-3-25 20:48 作者: machination 時(shí)間: 2025-3-26 01:01
On-Line Strategies for Evacuating from a Convex Region in the Plane achieve a bounded ratio of evacuation path length without any boundary information to that with. We restrict the affected area to a convex region in the plane, and present a 19.64-competitive strategy. It can be considered as the planar generalization of the .. Also, we give a 21-competitive strategy in the grid network.作者: ureter 時(shí)間: 2025-3-26 05:10 作者: convulsion 時(shí)間: 2025-3-26 10:20 作者: 啜泣 時(shí)間: 2025-3-26 13:58 作者: vanquish 時(shí)間: 2025-3-26 20:15
Randomized Online Algorithms for Set Cover Leasing Problemsline Set Cover with Repetitions presented by Alon et al. [.], where elements appear multiple times and must be covered by a different set at each arrival. Our results improve the . competitive factor of Online Set Cover with Repetitions [.] to ., where . is the maximum number of sets an element belongs to.作者: 中子 時(shí)間: 2025-3-26 23:47 作者: 上坡 時(shí)間: 2025-3-27 01:52 作者: Nonporous 時(shí)間: 2025-3-27 05:50
https://doi.org/10.1007/978-3-031-20490-6is fixed-parameter tractable (FPT). Simulation results using household power usage data show that peak power demand can be significantly reduced by allowing some flexibility in job execution times and applying scheduling.作者: Fluctuate 時(shí)間: 2025-3-27 09:40
Key Technologies on New Energy Vehicles be used to solve the MSC problem in linear time on simple orthogonal polygons . for which the dual graph induced by the vertical decomposition of . is a path. Our results provide the first polynomial-time exact algorithms for the MSC problem on a non-trivial subclass of orthogonal polygons.作者: 食品室 時(shí)間: 2025-3-27 16:01
Agriculture Automation and Controlaper, a deterministic tracking algorithm based on a dynamic binary tree is proposed to track .-approximate .-quantiles . in wireless sensor networks, whose total communication cost is ., where . is the number of the nodes in a network, . is the total number of the data items, and . is the required approximation error.作者: terazosin 時(shí)間: 2025-3-27 18:05 作者: choleretic 時(shí)間: 2025-3-28 01:05
https://doi.org/10.1007/978-3-031-52645-9ill be used to analyze the approximation ratio), and then optimize the algorithms to select MCDS with prune techniques. The major technique we use is an adaptive jitter scheme, which solves the open question in this area.作者: noxious 時(shí)間: 2025-3-28 04:51
An Exact Algorithm for Non-preemptive Peak Demand Job Schedulingis fixed-parameter tractable (FPT). Simulation results using household power usage data show that peak power demand can be significantly reduced by allowing some flexibility in job execution times and applying scheduling.作者: 使入迷 時(shí)間: 2025-3-28 09:58
Guarding Monotone Art Galleries with Sliding Cameras in Linear Time be used to solve the MSC problem in linear time on simple orthogonal polygons . for which the dual graph induced by the vertical decomposition of . is a path. Our results provide the first polynomial-time exact algorithms for the MSC problem on a non-trivial subclass of orthogonal polygons.作者: opalescence 時(shí)間: 2025-3-28 11:56 作者: 彩色 時(shí)間: 2025-3-28 17:38 作者: 投射 時(shí)間: 2025-3-28 21:54
Performance Analysis and Improvement for the Construction of MCDS Problem in 3D Spaceill be used to analyze the approximation ratio), and then optimize the algorithms to select MCDS with prune techniques. The major technique we use is an adaptive jitter scheme, which solves the open question in this area.作者: 機(jī)制 時(shí)間: 2025-3-28 23:02
0302-9743 ation and Applications, COCOA 2014, held on the island of Maui, Hawaii, USA, in December 2014. The 56 full papers included in the book were carefully reviewed and selected from 133 submissions. Topics covered include classic combinatorial optimization; geometric optimization; network optimization; o作者: cogent 時(shí)間: 2025-3-29 05:20
Claudia Steinberger,Judith Michaeld so far. Our algorithm for . is optimal and runs in . time, while the algorithm for ., where . is an integer, runs in . time. The algorithms have been implemented and tested on randomly generated convex polygons.作者: 忍耐 時(shí)間: 2025-3-29 11:15 作者: 陳腐的人 時(shí)間: 2025-3-29 12:25
Algorithms for Fair Partitioning of Convex Polygonsd so far. Our algorithm for . is optimal and runs in . time, while the algorithm for ., where . is an integer, runs in . time. The algorithms have been implemented and tested on randomly generated convex polygons.作者: 情感脆弱 時(shí)間: 2025-3-29 16:53
A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTWmial time approximation scheme (Q-PTAS) for this category of CVRPTW under the Euclidean setting. With a reasonable vehicle speed requirement, our algorithm could generate a set of routes of the length of . on expectation.作者: gusher 時(shí)間: 2025-3-29 23:19 作者: delegate 時(shí)間: 2025-3-30 00:47
A Practical Greedy Approximation for the Directed Steiner Tree Problemer a new .-approximation greedy algorithm called Greedy.., derived from a new fast .-approximation algorithm called Greedy. running in time at most ...We provide computational results to show that, Greedy. rivals the running time of the fast .-approximation and returns solution with smaller cost in practice.作者: 正常 時(shí)間: 2025-3-30 04:02 作者: 命令變成大炮 時(shí)間: 2025-3-30 08:38
0302-9743 reviewed and selected from 133 submissions. Topics covered include classic combinatorial optimization; geometric optimization; network optimization; optimization in graphs; applied optimization; CSoNet; and complexity, cryptography, and games.978-3-319-12690-6978-3-319-12691-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Sedative 時(shí)間: 2025-3-30 13:58 作者: diskitis 時(shí)間: 2025-3-30 18:13
Franziska Müller-Langer,Marco Klemmer a new .-approximation greedy algorithm called Greedy.., derived from a new fast .-approximation algorithm called Greedy. running in time at most ...We provide computational results to show that, Greedy. rivals the running time of the fast .-approximation and returns solution with smaller cost in practice.作者: 極為憤怒 時(shí)間: 2025-3-31 00:16 作者: 血統(tǒng) 時(shí)間: 2025-3-31 02:50
https://doi.org/10.1007/978-3-030-25590-9n when an unbounded polygonal complexity is allowed; however, eight sides are sufficient for Hamiltonian plane graphs. This line of research regarding monotone staircase modules is also motivated by the so-called monotone staircase cuts in VLSI floorplanning. We feel that our results provide a new i作者: BIBLE 時(shí)間: 2025-3-31 07:21 作者: 附錄 時(shí)間: 2025-3-31 13:09
An Asymptotic Competitive Scheme for Online Bin Packingin a bin of capacity . upon its arrival without any information on the next items, and the goal is to minimize the number of used bins. We present an asymptotic competitive scheme, i.e., for any ., the asymptotic competitive ratio is at most ., where . is the smallest possible asymptotic competitive
