標(biāo)題: Titlebook: Combinatorial Optimization and Applications; 5th International Co Weifan Wang,Xuding Zhu,Ding-Zhu Du Conference proceedings 2011 Springer-V [打印本頁] 作者: Jurisdiction 時(shí)間: 2025-3-21 19:28
書目名稱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é)科排名
作者: 尖酸一點(diǎn) 時(shí)間: 2025-3-22 00:02
A Near-Optimal Memoryless Online Algorithm for FIFO Buffering Two Packet Classes,me competitive ratio as the one presented in (Lotker and Patt-Shamir. PODC 2002, Computer Networks 2003). However, our algorithm is simpler and does not employ any marking bits. The idea used in our algorithm is novel and different from all previous approaches applied for the general model and its v作者: Biguanides 時(shí)間: 2025-3-22 04:01 作者: 裁決 時(shí)間: 2025-3-22 06:17
https://doi.org/10.1007/978-3-030-19396-6me competitive ratio as the one presented in (Lotker and Patt-Shamir. PODC 2002, Computer Networks 2003). However, our algorithm is simpler and does not employ any marking bits. The idea used in our algorithm is novel and different from all previous approaches applied for the general model and its v作者: 秘方藥 時(shí)間: 2025-3-22 11:51
Erico Przeybilovicz,Maria Alexandra Cunhahat extent. The other is to exploit possibilities of applying algebraic properties of polynomials to the study of those problems. A series of results about ΠΣΠ and ΠΣ polynomials are obtained in this paper, laying a basis for further study along this line.作者: ANT 時(shí)間: 2025-3-22 16:37 作者: ANT 時(shí)間: 2025-3-22 17:49 作者: 慟哭 時(shí)間: 2025-3-23 00:22
Peng Weibin,Fang Liuqing,Lin Xiaojingt three approximation algorithms for computing the optimal shortcuts of chains. One of them is a fully polynomial-time approximation scheme (FPTAS). We introduce two types of chains, strongly monotonic chain and simple chain. We provide properties for these two types of chains and their shortcuts.作者: 決定性 時(shí)間: 2025-3-23 05:00 作者: Pamphlet 時(shí)間: 2025-3-23 08:52
Euclidean Chains and Their Shortcuts,t three approximation algorithms for computing the optimal shortcuts of chains. One of them is a fully polynomial-time approximation scheme (FPTAS). We introduce two types of chains, strongly monotonic chain and simple chain. We provide properties for these two types of chains and their shortcuts.作者: CLAIM 時(shí)間: 2025-3-23 12:08
https://doi.org/10.1007/978-3-030-61033-3 when this online algorithm is compared with a clairvoyant algorithm achieving the best total value. In this paper, we study a simple and intuitive online algorithm. We analyze its performance in terms of competitive ratio for the general model and a few important variants.作者: 向宇宙 時(shí)間: 2025-3-23 14:02
Stories and Conversations in the Smart City, energy cost and access time into consideration to schedule the data retrieval process in multi-channel environments. It can be used in almost any broadcast environment, in which the data access frequencies, data sizes, and channel bandwidths can all be non-uniform.作者: Catheter 時(shí)間: 2025-3-23 19:05
Harish Karnatak,Kamal Pandey,V. Raghavaswamyrational probability while all nodes are immune to failures. We first design a complementary dynamic programming algorithm and then develop a parallel algorithm based on the underlying tree for finding an MRS on the network.作者: Chameleon 時(shí)間: 2025-3-24 00:29 作者: 輕而薄 時(shí)間: 2025-3-24 02:44
Catherine Crago Blanton,Walt TrybulaG algorithm, we propose an approximation algorithm. We also propose a heuristic algorithm for this special case. For the general case that each node has multiple power levels, we propose a general algorithm NF-MEM-R-G and an approximation algorithm based on NF-MEM-R-G algorithm. We also propose a heuristic algorithm for general case.作者: backdrop 時(shí)間: 2025-3-24 08:45 作者: Watemelon 時(shí)間: 2025-3-24 12:30 作者: 偶然 時(shí)間: 2025-3-24 17:38
A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unrerational probability while all nodes are immune to failures. We first design a complementary dynamic programming algorithm and then develop a parallel algorithm based on the underlying tree for finding an MRS on the network.作者: intertwine 時(shí)間: 2025-3-24 21:39
Restricted Edge Connectivity of Harary Graphs,nduced by .. A graph . is called ..-optimal if ..(.)?=?..(.). A natural question is whether there exists a graph . which is ..-optimal for any .?≤?|.(.)|/2. In this paper, we show that except for two cases, the Harary graph has this property.作者: IVORY 時(shí)間: 2025-3-25 01:00
Approximation Algorithms for Minimum Energy Multicast Routing with Reception Cost in Wireless SensoG algorithm, we propose an approximation algorithm. We also propose a heuristic algorithm for this special case. For the general case that each node has multiple power levels, we propose a general algorithm NF-MEM-R-G and an approximation algorithm based on NF-MEM-R-G algorithm. We also propose a heuristic algorithm for general case.作者: Deject 時(shí)間: 2025-3-25 05:46 作者: neutralize 時(shí)間: 2025-3-25 08:14
The Complexity of Testing Monomials in Multivariate Polynomials,hat extent. The other is to exploit possibilities of applying algebraic properties of polynomials to the study of those problems. A series of results about ΠΣΠ and ΠΣ polynomials are obtained in this paper, laying a basis for further study along this line.作者: 歌劇等 時(shí)間: 2025-3-25 12:32 作者: Panacea 時(shí)間: 2025-3-25 19:33
0302-9743 ussing on experimental and applied research of general algorithmic interest and research motivated by real-world problems.978-3-642-22615-1978-3-642-22616-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 打谷工具 時(shí)間: 2025-3-25 20:00
0302-9743 national Conference on Combinatorial Optimization and Applications, COCOA 2011, held in Zhangjiajie, China, in August 2011. The 43 revised full papers were carefully reviewed and selected from 65 submissions. The papers cover a broad range of topics in combinatorial optimization and applications foc作者: 有組織 時(shí)間: 2025-3-26 02:54 作者: motivate 時(shí)間: 2025-3-26 08:20
https://doi.org/10.1007/978-3-030-61033-3objectives: makespan, sum of .th (.?≥?0) power of jobs’ completion times, total weighted completion time, maximum lateness, total tardiness, total weighted tardiness, and number of tardy jobs. We further show that in the case of resumable scheduling with availability constraints, the above conclusions are still valid.作者: 沖擊力 時(shí)間: 2025-3-26 08:50
Harish Karnatak,Kamal Pandey,V. Raghavaswamyhat each vertex is colored by a color from its list. We proved that .. (.)?≤?4 if . where Mad (.) is the maximum average degree of .. And .. (.)?≤?4 if . is a planar graph of girth at least 7. Both results are sharp. In addition, we show that .. (.)?≤?6 for every planar graph ..作者: 暫時(shí)休息 時(shí)間: 2025-3-26 12:52 作者: 悅耳 時(shí)間: 2025-3-26 16:53 作者: Self-Help-Group 時(shí)間: 2025-3-26 21:11 作者: Jacket 時(shí)間: 2025-3-27 04:20 作者: 貪婪性 時(shí)間: 2025-3-27 05:17 作者: mettlesome 時(shí)間: 2025-3-27 12:53
Hybrid Artificial Bee Colony Search Algorithm Based on Disruptive Selection for Examination Timetab algorithm, there are three categories of bees. Employed bees select a random solution and apply a random neighborhood structure (exploration process), onlooker bees choose a food source depending on a selection strategy (exploitation process), and scout bees involves to search for new food sources 作者: 懶惰民族 時(shí)間: 2025-3-27 16:39
Heuristics for Parallel Machine Scheduling with Deterioration Effect,ing time. The objective is to minimize the makespan, and our focus is on the case with an arbitrary number of parallel machines. We prove that LIST rule is .-approximation where . is the number of machines and .. is the maximum deteriorating rate of job. We then propose one heuristic LDR (Largest de作者: 粗鄙的人 時(shí)間: 2025-3-27 19:25 作者: 政府 時(shí)間: 2025-3-27 22:40
Optimal Policy for Single-Machine Scheduling with Deterioration Effects, Learning Effects, Setup Tias well as general setup times. We prove that the shortest processing time (SPT) rule produces optimal schedules for the following seven minimization objectives: makespan, sum of .th (.?≥?0) power of jobs’ completion times, total weighted completion time, maximum lateness, total tardiness, total wei作者: 晚來的提名 時(shí)間: 2025-3-28 05:17
Algebraic Algorithm for Scheduling Data Retrieval in Multi-channel Wireless Data Broadcast Environmata retrieval method to provide users with reliable and timely access to the data scourers. In this paper, we study the scheduling problem for retrieving data from multi-channel data broadcast environments. In general conditions, the most important two issues for queries in mobile computing systems 作者: 染色體 時(shí)間: 2025-3-28 09:17
Hamiltonian Cycles through Prescribed Edges in ,-Ary ,-Cubes, . lies if, and only if, the subgraph of the .-ary .-cube induced by the edges of . is a vertex-disjoint collection of paths. This answers a question posed by Wang, Li and Wang who proved the analogous result for 3-ary .-cubes.作者: AER 時(shí)間: 2025-3-28 11:13 作者: 保守黨 時(shí)間: 2025-3-28 15:35 作者: 使混合 時(shí)間: 2025-3-28 19:47 作者: 沉默 時(shí)間: 2025-3-29 01:27
Euclidean Chains and Their Shortcuts,dge is the Euclidean distance between its two endpoints. A Euclidean chain .?=?(..,..,…, ..) is a planar straight line graph with vertex set {..,..,…, ..} and edge set {....: 1?≤?.?≤?.???1}. Given a Euclidean chain . in the plane, we study the problem of finding a pair of points on . such that the n作者: JOT 時(shí)間: 2025-3-29 03:46
List Dynamic Coloring of Sparse Graphs,rs. The ... (.) of . is the least integer . such that for every list assignment of size . to each vertex of ., there is a dynamic coloring of . such that each vertex is colored by a color from its list. We proved that .. (.)?≤?4 if . where Mad (.) is the maximum average degree of .. And .. (.)?≤?4 i作者: Indurate 時(shí)間: 2025-3-29 07:13 作者: genesis 時(shí)間: 2025-3-29 12:20 作者: Progesterone 時(shí)間: 2025-3-29 15:43 作者: 系列 時(shí)間: 2025-3-29 22:32
Minimum Latency Data Aggregation in Wireless Sensor Network with Directional Antenna,e interference. In this paper, we study the minimum latency data aggregation problem with directional antenna model under protocol interference model. We propose an approximation directional data aggregation algorithm to schedule data transmissions, which can save energy and reduce interference to r作者: Frenetic 時(shí)間: 2025-3-30 00:38 作者: Metastasis 時(shí)間: 2025-3-30 06:05 作者: 來自于 時(shí)間: 2025-3-30 08:37
Hamiltonian Cycles through Prescribed Edges in ,-Ary ,-Cubes, . lies if, and only if, the subgraph of the .-ary .-cube induced by the edges of . is a vertex-disjoint collection of paths. This answers a question posed by Wang, Li and Wang who proved the analogous result for 3-ary .-cubes.作者: 懶鬼才會(huì)衰弱 時(shí)間: 2025-3-30 16:09 作者: ORBIT 時(shí)間: 2025-3-30 17:17
Public Communication Based on Russian Cards Protocol: A Case Study,ved Russian Cards protocol is presented. As a case study, .(6,31)(6 players and 31 cards) protocol is used to generate a common password for 5 parties who wish to access a shared file over the Internet.作者: 預(yù)兆好 時(shí)間: 2025-3-30 23:43 作者: RAGE 時(shí)間: 2025-3-31 01:12
On the Maximum Locally Clustered Subgraph and Some Related Problems,ansitivity in social networks. We give a polynomial time algorithm for one problem and show the NP-hardness of the other. For the NP-hard problem, we show some polynomial time solvable cases and give a 2-approximation algorithm for a restricted version. We also propose a heuristic algorithm for a more general version of the problem.作者: 急急忙忙 時(shí)間: 2025-3-31 05:18 作者: Daily-Value 時(shí)間: 2025-3-31 10:06
Weifan Wang,Xuding Zhu,Ding-Zhu DuState-of-the-art research.Fast-track conference proceedings.Unique visibility作者: FEMUR 時(shí)間: 2025-3-31 15:02
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229978.jpg作者: ROOF 時(shí)間: 2025-3-31 18:37 作者: cochlea 時(shí)間: 2025-4-1 00:02 作者: 奴才 時(shí)間: 2025-4-1 04:57 作者: JOG 時(shí)間: 2025-4-1 09:44
Erico Przeybilovicz,Maria Alexandra Cunhaolynomial represented by an arithmetic circuit has some types of monomials in its sum-product expansion. The complexity aspects of this problem and its variants have been investigated in our first paper by Chen and Fu (2010), laying a foundation for further study. In this paper, we present two pairs作者: CUMB 時(shí)間: 2025-4-1 12:05
Smart Cities and Smart Governance algorithm, there are three categories of bees. Employed bees select a random solution and apply a random neighborhood structure (exploration process), onlooker bees choose a food source depending on a selection strategy (exploitation process), and scout bees involves to search for new food sources 作者: 沒收 時(shí)間: 2025-4-1 16:30 作者: 女歌星 時(shí)間: 2025-4-1 22:26
