標題: Titlebook: Combinatorial Optimization and Applications; 4th International Co Weili Wu,Ovidiu Daescu Conference proceedings 2010 Springer Berlin Heidel [打印本頁] 作者: Addendum 時間: 2025-3-21 16:48
書目名稱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é)科排名
作者: Vulnerable 時間: 2025-3-21 22:11
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives,. In this paper we prove that Ω(log.) tests are really needed. The proof is based on an analysis of the influence of tests on the searcher’s ability to distinguish between any two candidate numbers with a constant ratio. Once we know this lower bound, the next challenge is to get optimal constant fa作者: PIZZA 時間: 2025-3-22 02:42
An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs,n .-dense graphs within a factor of 1???. is .-hard. We then demonstrate that for weighted versions (both node- and edge- weighted) of this problem, we cannot get . approximation algorithm with strictly better performance guarantee in .-dense graphs than that of the best possible approximation algor作者: FOIL 時間: 2025-3-22 08:13
Fast Edge-Searching and Related Problems,problem of computing node search numbers to the problem of computing fast edge-search time or fast search numbers. Using these relations, we prove that the problem of deciding, given a graph . and an integer ., whether the fast (edge-)search number of . is less than or equal to . is NP-complete; and作者: 假 時間: 2025-3-22 09:33 作者: 全部 時間: 2025-3-22 15:38 作者: 全部 時間: 2025-3-22 20:02 作者: 忘恩負義的人 時間: 2025-3-22 21:47 作者: 類型 時間: 2025-3-23 02:44 作者: cortex 時間: 2025-3-23 08:21 作者: antedate 時間: 2025-3-23 11:11
Constrained Surface-Level Gateway Placement for Underwater Acoustic Wireless Sensor Networks,h that it is connected (or 2-connected) from any USN to the base station. We propose a polynomial time approximation algorithm for the connected C-SGP problem and survivable C-SGP problem, respectively. Simulations are conducted to verify our algorithms’ efficiency.作者: 上下倒置 時間: 2025-3-23 17:42
A Constant-Factor Approximation Algorithm for the Link Building Problem,e algorithm where we choose backlinks from nodes with high PageRank values compared to the outdegree and show that the naive algorithm performs much worse on certain graphs compared to the constant factor approximation scheme.作者: Musculoskeletal 時間: 2025-3-23 18:08
Approximation Algorithm for the Minimum Directed Tree Cover, to approximate DTCP with the same ratio as for SCP. We show that this expectation can be satisfied in some way by designing a purely combinatorial approximation algorithm for the DTCP and proving that the approximation ratio of the algorithm is max {2, ln (..)} with .. is the maximum outgoing degree of the nodes in ..作者: 議程 時間: 2025-3-24 01:18 作者: 安慰 時間: 2025-3-24 06:26
Ahmed Nabil Belbachir,Peter Michael G?belult. For graphs with small or moderate branchwidth, the CDS problem instances with size up to a few thousands edges can be solved in a practical time and memory space. This suggests that the branch-decomposition based algorithms can be practical for the planar CDS problem.作者: cortex 時間: 2025-3-24 10:34
Card and Application Managementhere is a path in the Yao graph .. whose length is at most 8.82 times the edge length. Combined with the result of Bonichon, Gavoille, Hanusse and Ilcinkas, who prove an upper bound of 2 on the stretch factor of Θ., we obtain an upper bound of 17.7 on the stretch factor of ...作者: 多骨 時間: 2025-3-24 14:31 作者: bifurcate 時間: 2025-3-24 18:04
Computational Study for Planar Connected Dominating Set Problem,ult. For graphs with small or moderate branchwidth, the CDS problem instances with size up to a few thousands edges can be solved in a practical time and memory space. This suggests that the branch-decomposition based algorithms can be practical for the planar CDS problem.作者: 沒有貧窮 時間: 2025-3-24 19:34
Yao Graphs Span Theta Graphs,here is a path in the Yao graph .. whose length is at most 8.82 times the edge length. Combined with the result of Bonichon, Gavoille, Hanusse and Ilcinkas, who prove an upper bound of 2 on the stretch factor of Θ., we obtain an upper bound of 17.7 on the stretch factor of ...作者: VEIL 時間: 2025-3-24 23:49
Hua Zhang,Li Li,Xiang He,Xingzhen Zhuh that it is connected (or 2-connected) from any USN to the base station. We propose a polynomial time approximation algorithm for the connected C-SGP problem and survivable C-SGP problem, respectively. Simulations are conducted to verify our algorithms’ efficiency.作者: Diuretic 時間: 2025-3-25 06:36 作者: Bombast 時間: 2025-3-25 07:50
Smart Cameras: Technologies and Applications to approximate DTCP with the same ratio as for SCP. We show that this expectation can be satisfied in some way by designing a purely combinatorial approximation algorithm for the DTCP and proving that the approximation ratio of the algorithm is max {2, ln (..)} with .. is the maximum outgoing degree of the nodes in ..作者: 核心 時間: 2025-3-25 12:23 作者: disparage 時間: 2025-3-25 16:12
https://doi.org/10.1007/978-3-319-69523-5al antennae whose range differs from the optimal range by a multiplicative factor of at most .. Moreover, given a minimum spanning tree on the set of points the spanner can be constructed in additional .(.) time. In addition, we prove NP completeness results for .?=?2 antennae.作者: follicle 時間: 2025-3-25 20:46 作者: ascend 時間: 2025-3-26 03:15 作者: MERIT 時間: 2025-3-26 05:58
Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle,al antennae whose range differs from the optimal range by a multiplicative factor of at most .. Moreover, given a minimum spanning tree on the set of points the spanner can be constructed in additional .(.) time. In addition, we prove NP completeness results for .?=?2 antennae.作者: penance 時間: 2025-3-26 09:16 作者: conflate 時間: 2025-3-26 14:09 作者: Debility 時間: 2025-3-26 18:51 作者: 滔滔不絕地說 時間: 2025-3-27 00:00
Ahmed Nabil Belbachir,Peter Michael G?bell. Furthermore, there is no overlap between any two subtrees selected in the solution. We prove that this problem is NP-hard and present a fully polynomial-time approximation scheme (FPTAS) as a solution.作者: 擁護者 時間: 2025-3-27 02:20 作者: 小平面 時間: 2025-3-27 06:54 作者: 孵卵器 時間: 2025-3-27 12:26 作者: Optometrist 時間: 2025-3-27 15:32
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs,n polynomial time whenever . is odd, and NP-hard when . is even. Motivated by our use of hypergraphs, we define a class of hypergraphs which lies strictly in between the well studied classes of acyclic hypergraphs and normal hypergraphs.作者: 構(gòu)成 時間: 2025-3-27 19:34 作者: 結(jié)果 時間: 2025-3-28 01:07
Coverage with ,-Transmitters in the Presence of Obstacles, . “walls”, represented as line segments in the plane. We develop lower and upper bounds for the number of .-transmitters that are necessary and sufficient to cover a given collection of line segments, polygonal chains and polygons.作者: BOLT 時間: 2025-3-28 04:00 作者: 不確定 時間: 2025-3-28 08:08 作者: countenance 時間: 2025-3-28 13:23
Constrained Surface-Level Gateway Placement for Underwater Acoustic Wireless Sensor Networks,is paper addresses the connected (or survivable) Constrained Surface-level Gateway Placement (C-SGP) problem for 3-D underwater acoustic sensor networks. Given a set of candidate locations where SGs can be placed, our objective is to place minimum number of SGs at a subset of candidate locations suc作者: 嫌惡 時間: 2025-3-28 17:46 作者: fringe 時間: 2025-3-28 22:08
Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle,ove that for each given integer 1?≤?.?≤?5 there is a strongly connected spanner on the set of points so that each sensor uses at most . such directional antennae whose range differs from the optimal range by a multiplicative factor of at most .. Moreover, given a minimum spanning tree on the set of 作者: 不遵守 時間: 2025-3-28 23:03
A Constant-Factor Approximation Algorithm for the Link Building Problem, new links must point to the given target node (backlinks). Previous work [7] shows that this problem has no fully polynomial time approximation schemes unless .?=?.. We present a polynomial time algorithm yielding a PageRank value within a constant factor from the optimal. We also consider the naiv作者: restrain 時間: 2025-3-29 03:42 作者: adipose-tissue 時間: 2025-3-29 11:14
Computational Study for Planar Connected Dominating Set Problem,] introduce a new technique to generate . time and fixed-parameter algorithms for a number of non-local hard problems, including the CDS problem in planar graphs. The practical performance of this algorithm is yet to be evaluated. We perform a computational study for such an evaluation. The results 作者: 蕨類 時間: 2025-3-29 11:32
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives,t whether it contains defectives or not. Strategies are preferred that use both a small number of tests close to the information-theoretic lower bound .log., and a small constant number of stages, where tests in every stage are done in parallel, in order to save time. They should even work if . is c作者: indenture 時間: 2025-3-29 15:37 作者: d-limonene 時間: 2025-3-29 21:35
Approximation Algorithm for the Minimum Directed Tree Cover,th of them) of every arc in . is touched by .. The minimum directed tree cover problem (DTCP) is to find a directed tree cover of minimum cost. The problem is known to be .-hard. In this paper, we show that the weighted Set Cover Problem (SCP) is a special case of DTCP. Hence, one can expect at best作者: PANG 時間: 2025-3-30 01:15
An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs,he . of a spanning star forest is the number of leaves in all its components. The goal of the . [12] is to find the maximum-size spanning star forest of a given graph..In this paper, we study this problem in .-dense graphs, where for .?∈?(0,1), a graph of . vertices is called . if it contains at lea作者: Nonthreatening 時間: 2025-3-30 06:49 作者: 安裝 時間: 2025-3-30 10:30
A Simpler Algorithm for the All Pairs Shortest Path Problem with ,(,,log,) Expected Time,ka. Let the solution set be the set of vertices to which the given algorithm has established shortest paths. The Moffat-Takaoka algorithm maintains complexities before and after the critical point in balance, which is the moment when the size of the solution set is .???./log.. In this paper, we remo作者: 無畏 時間: 2025-3-30 13:23
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs,y referred to as an induced matching. In this paper, we show that when . is weakly chordal, the size of the largest induced matching in . is equal to the minimum number of co-chordal subgraphs of . needed to cover the edges of ., and that the co-chordal subgraphs of a minimum cover can be found in p作者: 倫理學(xué) 時間: 2025-3-30 19:00 作者: 軍火 時間: 2025-3-30 22:40
Fast Edge-Searching and Related Problems,hers required to capture the fugitive. In this paper, we consider the problem of finding the minimum number of steps to capture the fugitive. We introduce the fast edge-searching problem in the edge search model, which is the problem of finding the minimum number of steps (called the fast edge-searc作者: GLUE 時間: 2025-3-31 02:40
Combinatorial Optimization and Applications978-3-642-17461-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 冰雹 時間: 2025-3-31 08:55
Hua Zhang,Li Li,Xiang He,Xingzhen Zhu . “walls”, represented as line segments in the plane. We develop lower and upper bounds for the number of .-transmitters that are necessary and sufficient to cover a given collection of line segments, polygonal chains and polygons.作者: 使顯得不重要 時間: 2025-3-31 12:47
https://doi.org/10.1007/978-3-642-55969-3length is minimum among all .-paths of lengths strictly larger than the shortest path length. In this paper we give an .(|.|log|.|?+?|.|) time algorithm for this problem, which improves the previous result of .(|.|.) time for sparse graphs.作者: fulmination 時間: 2025-3-31 15:02
https://doi.org/10.1007/978-3-642-17461-2Blu-ray; algorithms; approximation algorithms; bioinformatics; cloud computing; combinatorial optimizatio作者: brachial-plexus 時間: 2025-3-31 17:52
978-3-642-17460-5Springer Berlin Heidelberg 2010作者: 娘娘腔 時間: 2025-4-1 01:10 作者: 能量守恒 時間: 2025-4-1 03:28
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem,length is minimum among all .-paths of lengths strictly larger than the shortest path length. In this paper we give an .(|.|log|.|?+?|.|) time algorithm for this problem, which improves the previous result of .(|.|.) time for sparse graphs.作者: COLIC 時間: 2025-4-1 08:51 作者: 不足的東西 時間: 2025-4-1 10:22 作者: pulse-pressure 時間: 2025-4-1 15:16 作者: 母豬 時間: 2025-4-1 21:13
