標(biāo)題: Titlebook: Combinatorial Optimization and Applications; 11th International C Xiaofeng Gao,Hongwei Du,Meng Han Conference proceedings 2017 Springer Int [打印本頁] 作者: 小故障 時(shí)間: 2025-3-21 18:37
書目名稱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é)科排名
作者: Airtight 時(shí)間: 2025-3-22 00:09 作者: Mortar 時(shí)間: 2025-3-22 01:25
Fast Approximation Algorithms for Computing Constrained Minimum Spanning Trees作者: gentle 時(shí)間: 2025-3-22 08:32
Protein Mover’s Distance: A Geometric Framework for Solving Global Alignment of PPI Networksconsists of two steps, Embedding and Matching. For the embedding step, we apply three different graph embedding techniques to preserve the topological structures of the original PPI networks. For the matching step, we compute a rigid transformation for one of the embedded PPI networks so as to minim作者: braggadocio 時(shí)間: 2025-3-22 11:53 作者: 抵押貸款 時(shí)間: 2025-3-22 14:38
0302-9743 ference on Combinatorial Optimization and Applications, COCOA 2017,?held in Shanghai, China, in December 2017...The 59 full papers and 19 short papers presented were carefully reviewed and?selected from 145 submissions. The papers?cover most aspects of theoretical computer science and combinatorics 作者: 抵押貸款 時(shí)間: 2025-3-22 18:12 作者: MILK 時(shí)間: 2025-3-22 23:22 作者: 憤怒事實(shí) 時(shí)間: 2025-3-23 04:57
https://doi.org/10.1007/b119213 further propose a data replication algorithm which is a unified method, integrating data aggregation and data redistribution. Extensive simulations show that our proposed algorithms significantly outperform than existing algorithms especially in extending the lifetime of the sensor network.作者: 陶瓷 時(shí)間: 2025-3-23 08:45
Smart Antenna Systems and Wireless LANsrespect to .. The algorithm is based on the reverse search method, and enumerates all feasible floorplans in . time using .(.) space where . is the set of the feasible floorplans of . with respect to ., while the known algorithms need either . time and .(.) space or . time and . space.作者: Functional 時(shí)間: 2025-3-23 11:02 作者: dominant 時(shí)間: 2025-3-23 16:09
Mehaboob Mujawar,T. Gunasekaranstrategy for maximizing the benefit of transaction platforms with satisfying individual rationality constraint and incentive compatibility constraint. Finally, we propose two practical algorithms based on the best strategy. Our simulations show that the algorithms are effective in terms of keeping the platform’s profit and time efficiency.作者: 憤怒事實(shí) 時(shí)間: 2025-3-23 21:55 作者: RECUR 時(shí)間: 2025-3-23 23:11 作者: dictator 時(shí)間: 2025-3-24 03:57 作者: Living-Will 時(shí)間: 2025-3-24 08:58 作者: 心胸開闊 時(shí)間: 2025-3-24 11:02 作者: Biguanides 時(shí)間: 2025-3-24 15:22 作者: dissolution 時(shí)間: 2025-3-24 20:30
Approximation Algorithms for the Generalized Stacker Crane Problemlem. The first algorithm uses some exact algorithm to solve the integral circulation problem, and the second algorithm uses some approximation algorithm to solve the metric traveling salesman problem. Combining these two approximation algorithms, we can design a 9/5-approximation algorithm to solve the GSC problem.作者: LEVY 時(shí)間: 2025-3-25 03:07 作者: cardiopulmonary 時(shí)間: 2025-3-25 03:22
Conference proceedings 2017pplications, COCOA 2017,?held in Shanghai, China, in December 2017...The 59 full papers and 19 short papers presented were carefully reviewed and?selected from 145 submissions. The papers?cover most aspects of theoretical computer science and combinatorics related to computing, including classic com作者: 修正案 時(shí)間: 2025-3-25 07:31 作者: 行為 時(shí)間: 2025-3-25 11:41 作者: 膠狀 時(shí)間: 2025-3-25 16:39 作者: Perigee 時(shí)間: 2025-3-25 21:58
Building Valid Career Ontologies with B-CPNsn the clockwise direction of a bidirectional ring networks with five nodes. For the latter problem with six nodes, we propose a .-approximation algorithm. All the algorithms are combinatorial and constructive, whose performance ratios are strictly smaller than the best known ones to date.作者: 相信 時(shí)間: 2025-3-26 01:31
Amina Oussaleh Taoufik,Abdellah AzmaniE-complete for chordal graphs even if the number of colors is a fixed constant. We then demonstrate that, even when the number of colors is a part of input, the problem is solvable in polynomial time for several graph classes, such as split graphs and trivially perfect graphs.作者: GLUT 時(shí)間: 2025-3-26 04:39
A New Approximation Algorithm for the Maximum Stacking Base Pairs Problem from RNA Secondary Structuof this problem that the candidate base pairs are given explicitly as input, and present a new approximation algorithm for this problem by the local search method, improving the approximation factor from 5/2 to 7/3. The time complexity is within ., since we adopt 1-substitution and special 2-substitutions in the local improvement steps.作者: 大量 時(shí)間: 2025-3-26 09:48
Trajectory-Based Multi-hop Relay Deployment in Wireless Networksnd Node Coverage (DNC) problem, which is NP-complete. After that, we design an approximation algorithm, named . (SIDA), to solve the DNC problem with the approximation factor .. The simulation on five real datasets shows that our algorithm can obtain high coverage for users in motion, leading to better user experience.作者: Genteel 時(shí)間: 2025-3-26 13:24 作者: 規(guī)范就好 時(shí)間: 2025-3-26 17:54 作者: 縱欲 時(shí)間: 2025-3-26 21:37 作者: ORBIT 時(shí)間: 2025-3-27 02:41
Conference proceedings 2017binatorial optimization, geometric optimization, complexity and data structures, and graph theory. They are organized in topical sections on network, approximation algorithm and graph theory, combinatorial optimization, game theory, and applications..作者: BULLY 時(shí)間: 2025-3-27 06:16 作者: lethal 時(shí)間: 2025-3-27 12:36
Filtering Undesirable Flows in Networksodel this problem and then we concentrate on a subproblem where every good flow has a bottleneck. We prove that unless ., this subproblem is inapproximable within factor ., for . and any .. We provide a .-factor polynomial approximation, where . bounds the number of the desirable flows that a desira作者: 原諒 時(shí)間: 2025-3-27 15:06 作者: Obituary 時(shí)間: 2025-3-27 19:46
Floorplans with Columnsoint in . is on the common boundary between two rectangles in .. We call such a partition of . a feasible floorplan of . with respect to .. Intuitively . is the locations of columns and a feasible floorplan is a floorplan in which no column is in the proper inside of a room, i.e., columns are allowe作者: Pigeon 時(shí)間: 2025-3-27 22:31 作者: 使尷尬 時(shí)間: 2025-3-28 04:39 作者: 主動(dòng) 時(shí)間: 2025-3-28 06:56
On the Profit-Maximizing for Transaction Platforms in Crowd Sensingers and transaction platforms for attracting sufficient participants. Little attention in literature has been paid to the transaction platform’s profit which is one of the major issues for maintaining a crowd sensing system consistently. In this paper, we aim to propose a mechanism design for optimi作者: Angiogenesis 時(shí)間: 2025-3-28 11:54
A New Approximation Algorithm for the Maximum Stacking Base Pairs Problem from RNA Secondary Structu pairs problem as: given an RNA sequence, to find a maximum number of base pairs where each base pair is involved in a stacking. Ieong et al. showed this problem to be NP-hard, where the candidate base pairs follow some biology principle and are given implicitly. In this paper, we study the version 作者: Substance 時(shí)間: 2025-3-28 15:33
Approximation Algorithms for the Generalized Stacker Crane Problem such that all arcs in a mixed graph . must be traversed at least once. In the real literature, since many different building materials must be handled, we consider the generalized stacker crane (GSC) problem, and the objective of this new problem is to determine a minimum weighted tour . traversing作者: 萬神殿 時(shí)間: 2025-3-28 20:25 作者: 易達(dá)到 時(shí)間: 2025-3-28 23:39
A Local Search Approximation Algorithm for a Squared Metric ,-Facility Location Problemproblem (SMFLP) and .-facility location problem (.-FLP). In the SM-.-FLP, we are given a client set . and a facility set . from a metric space, a facility opening cost . for each ., and an integer .. The goal is to open a facility subset . with . and to connect each client to the nearest open facili作者: 殺死 時(shí)間: 2025-3-29 05:48
Combinatorial Approximation Algorithms for Spectrum Assignment Problem in Chain and Ring Networksn spectrum sliced elastic optical path network. Improved algorithms with guaranteed performance ratios are provided for several NP-hard scenarios of the SA problem. Concretely, we develop .-approximation algorithms for the SA problem in chain networks with five or six nodes, and for the SA problem i作者: BRINK 時(shí)間: 2025-3-29 07:24 作者: Ceramic 時(shí)間: 2025-3-29 12:37
Conflict-Free Connection Numbers of Line Graphswo distinct vertices of ., there is a conflict-free path connecting them. For a connected graph ., the . of ., denoted by .(.), is defined as the minimum number of colors that are required to make . conflict-free connected. In this paper, we investigate the conflict-free connection numbers of connec作者: 思想流動(dòng) 時(shí)間: 2025-3-29 17:30
The Coloring Reconfiguration Problem on Specific Graph Classes at all times maintaining a .-coloring, where . denotes the number of colors. This decision problem is known to be PSPACE-complete even for bipartite graphs and any fixed constant .. In this paper, we study the problem from the viewpoint of graph classes. We first show that the problem remains PSPAC作者: 搖曳的微光 時(shí)間: 2025-3-29 22:41
Minimizing Total Completion Time of Batch Scheduling with Nonidentical Job Sizese objective is to minimize the total completion time of all jobs. We show that the worst-case ratio of the algorithm based on the bin-packing algorithm First Fit Increasing (.) lies in the interval . for the single machine case, and is no more than . for the parallel machines case.作者: APNEA 時(shí)間: 2025-3-30 01:24 作者: 生來 時(shí)間: 2025-3-30 04:41 作者: DNR215 時(shí)間: 2025-3-30 09:13 作者: CRUDE 時(shí)間: 2025-3-30 14:23
https://doi.org/10.1007/b119213data items are generated than available storage space in the entire network. In this paper, we consider overall storage overflow problem in WSNs, the goal of which is to maximize the minimum remaining energy of data node (the node with overflow data) in order to prolong the lifetime of the sensor ne作者: 對(duì)手 時(shí)間: 2025-3-30 19:56 作者: defibrillator 時(shí)間: 2025-3-30 23:04
https://doi.org/10.1007/b119213security. The star network was proposed as an attractive interconnection network model for competing with .-cube. Accordingly, Rescigno in?[Inform. Sci. 137 (2001) 259–276] proposed an algorithm to construct . VDSTs rooted at a common node in an .-dimensional star network .. In this paper, we point 作者: 正式演說 時(shí)間: 2025-3-31 01:10
Smart Wireless LAN System Design,s a protein and each edge connecting two nodes indicates their interaction. Given two PPI networks, finding their alignment is a fundamental problem and has many important applications in bioinformatics. However, it often needs to solve some generalized version of subgraph isomorphism problem which 作者: 起皺紋 時(shí)間: 2025-3-31 05:42
Mehaboob Mujawar,T. Gunasekaraners and transaction platforms for attracting sufficient participants. Little attention in literature has been paid to the transaction platform’s profit which is one of the major issues for maintaining a crowd sensing system consistently. In this paper, we aim to propose a mechanism design for optimi
