標題: Titlebook: Combinatorial Optimization and Applications; 6th International Co Guohui Lin Conference proceedings 2012 Springer-Verlag Berlin Heidelberg [打印本頁] 作者: angiotensin-I 時間: 2025-3-21 16:20
書目名稱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é)科排名
作者: 冥想后 時間: 2025-3-21 23:17
Complexity Results for the Empire Problem in Collection of Stars, of size .?+?1 and .?=?2.???1 is .-complete for forests of ... Moreover, we prove that this result holds for .?=?2. Also for .?≥?3, if the .-coloring problem in (.?+?1)-regular graphs is .-complete, then the Empire Problem for blocks of size .?+?1 and .?=?. is .-complete for forests of ..?=?.., i.e.作者: Brain-Imaging 時間: 2025-3-22 00:37
On the Central Path Problem,.?+?.)log.log..) and the worst case running time is .(..2.log.), where . is the size of ., . is the total number of self-intersecting points of each individual curve in ., . is the size of the visited portion of .(.) by the central path algorithm, and . is the number of intersections between the vis作者: 我沒有命令 時間: 2025-3-22 06:44 作者: 祖先 時間: 2025-3-22 11:49
https://doi.org/10.1007/978-3-319-27753-0t we call . networks (. for short), is always in between the sizes of the solutions for the same instance with respect to the standard matching and its induced version problems. However, we prove that . is .-hard even for proper interval graphs and for bipartite graphs of maximum degree Δ?≥?3. We al作者: 占線 時間: 2025-3-22 14:39
Camilo Castellanos,Boris Perez,Dario Correal of size .?+?1 and .?=?2.???1 is .-complete for forests of ... Moreover, we prove that this result holds for .?=?2. Also for .?≥?3, if the .-coloring problem in (.?+?1)-regular graphs is .-complete, then the Empire Problem for blocks of size .?+?1 and .?=?. is .-complete for forests of ..?=?.., i.e.作者: 占線 時間: 2025-3-22 18:56
https://doi.org/10.1007/978-981-15-2837-8.?+?.)log.log..) and the worst case running time is .(..2.log.), where . is the size of ., . is the total number of self-intersecting points of each individual curve in ., . is the size of the visited portion of .(.) by the central path algorithm, and . is the number of intersections between the vis作者: 帶來的感覺 時間: 2025-3-22 21:14
https://doi.org/10.1007/978-981-15-2837-8in time. Our approach is the first to achieve a Ω(.(.)) time speedup without reducing the set of possible Rivas&Eddy pseudoknotted structures. The analysis presented here of the original algorithm could be used to improve other pseudoknot algorithms with similar recurrences.作者: DEAWL 時間: 2025-3-23 04:53 作者: 命令變成大炮 時間: 2025-3-23 08:49
Algorithms for Forest Local Similarity,sts: sibling subforests and closed subforests. Our algorithms can be used to locate the structurally similar regions in RNA secondary structures since RNA molecules’ secondary structures could be represented as ordered labelled forests.作者: 背帶 時間: 2025-3-23 13:27
The ,-Matching Problem in Hypergraphs: Hardness and Approximability, .. This result generalizes a result of Kann from .?=?1 to the case that .?∈?? with .. Furthermore, we extend a result of Srivastav and Stangier, who gave an approximation algorithm for the unweighted .-matching problem.作者: 合法 時間: 2025-3-23 17:10
Resource Scheduling with Supply Constraint and Linear Cost,blem is NP-hard when . is the input of the problem. We then give a simple greedy algorithm with 2-approximation ratio. Finally, we present a polynomial time algorithm with complexity .(..) to solve this problem when the number of different resources requirements that are not multiples of . is at most ..作者: 詞匯表 時間: 2025-3-23 18:59 作者: 非實體 時間: 2025-3-23 23:36
G?k?en Firdevs Yücel Caymaz,Kür?at Kemal Kulgive examples showing that |.(.)???.(..)| can be arbitrarily large. Further, we characterize permutation graphs .. satisfying .(..)?=?. for a graph . that is a nearly complete graph, a complete .-partite graph, a cycle, and a path, respectively, on . vertices.作者: Trypsin 時間: 2025-3-24 04:34 作者: ALOFT 時間: 2025-3-24 06:42 作者: CULP 時間: 2025-3-24 14:45
Conference proceedings 2012 revised papers including one invited talk and one keynote talk were carefully reviewed and selected from 57 submissions. The papers are focused to theoretical results and also on recent works on experimental and applied research of general algorithmic interest.作者: 高興去去 時間: 2025-3-24 17:06
0302-9743 were carefully reviewed and selected from 57 submissions. The papers are focused to theoretical results and also on recent works on experimental and applied research of general algorithmic interest.978-3-642-31769-9978-3-642-31770-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 胰臟 時間: 2025-3-24 22:13
Anindita Sarkar Mondal,Samiran Chattopadhyayt the number of Hamiltonian paths starting at a single vertex in . is the maximum over all possible outerplanar graphs with . vertices. Finally, we prove a 2.2134. upper bound on the number of Hamiltonian cycles in planar graphs, which improves the previously best known upper bound 2.3404..作者: Apraxia 時間: 2025-3-25 01:59 作者: FRONT 時間: 2025-3-25 04:43 作者: 擔憂 時間: 2025-3-25 10:55 作者: 上腭 時間: 2025-3-25 14:17 作者: Indolent 時間: 2025-3-25 19:22
G?k?en Firdevs Yücel Caymaz,Kür?at Kemal Kulh bounded degree and arbitrarily large can(.). We also initiate studying the . of geometric graphs. We construct bounded degree graphs .?=?(.,.) such that for any two straight-line drawings of . with the same prescribed crossing angles, there is a subset .′???. of |.′|?≥?|.|/2 vertices that are similar in the two drawings.作者: Lucubrate 時間: 2025-3-25 21:28
https://doi.org/10.1007/978-981-15-2837-8ng clique-width whether they lead to tractability or not. Since bounded tree-width implies bounded clique-width, our tractability results extend previous results via tree-width, in particular to dense graphs.作者: Morose 時間: 2025-3-26 03:27 作者: 膽小鬼 時間: 2025-3-26 06:15 作者: 嚴厲譴責 時間: 2025-3-26 12:00
Multicut on Graphs of Bounded Clique-Width,ng clique-width whether they lead to tractability or not. Since bounded tree-width implies bounded clique-width, our tractability results extend previous results via tree-width, in particular to dense graphs.作者: chapel 時間: 2025-3-26 15:47 作者: IDEAS 時間: 2025-3-26 17:21
A. Coulbaut-Lazzarini,G. Bailly, the Load-Balanced Virtual Backbone (LBVB) problem, and the MinMax Valid-Degree non Backbone node Allocation (MVBA) problem. We claim that MDMIS and LBVB are NP-Complete and MVBA is NP-Hard. Moveover, approximation algorithms and comprehensive theoretical analysis of the approximation factors are presented in the paper.作者: jabber 時間: 2025-3-26 21:10
Monetarisierung von Mobilit?tsplattformennsmission range, but also the hop-stretch factor of the communication network (in relation to the omnidirectional model). We refer to this as the Antenna Orientation Problem with Constant Stretch Factor. We present approximations to this problem for antennae with angles ./2?≤?.?≤?2..作者: 斜谷 時間: 2025-3-27 03:19
Camilo Castellanos,Boris Perez,Dario Correalsum of the degrees of vertices whose degree is at least three on the tree is .. Combined with known tractability where this sum is ., we show a dichotomy of complexity of FVS on tree convex bipartite graphs.作者: 有幫助 時間: 2025-3-27 08:43
https://doi.org/10.1007/978-981-15-2837-8bounded search tree algorithm, we obtain an FPT algorithm running in .(6..?+?.) time. For .?.. we present a bounded search tree algorithm which runs in ..(2.45.) time, greatly improving the previous bound using weak kernels.作者: cajole 時間: 2025-3-27 10:16
https://doi.org/10.1007/978-981-15-2837-8ving an .(..?+?2.) time algorithm, where . is the size of an optimal solution, and the GMWC(T) problem is polynomial time solvable when the problem is restricted in paths. We also discuss some heuristics for the GMWC(T) problem.作者: glomeruli 時間: 2025-3-27 14:42
Load-Balanced Virtual Backbone Construction for Wireless Sensor Networks,, the Load-Balanced Virtual Backbone (LBVB) problem, and the MinMax Valid-Degree non Backbone node Allocation (MVBA) problem. We claim that MDMIS and LBVB are NP-Complete and MVBA is NP-Hard. Moveover, approximation algorithms and comprehensive theoretical analysis of the approximation factors are presented in the paper.作者: Dysarthria 時間: 2025-3-27 21:00
Stretch Factor in Wireless Sensor Networks with Directional Antennae,nsmission range, but also the hop-stretch factor of the communication network (in relation to the omnidirectional model). We refer to this as the Antenna Orientation Problem with Constant Stretch Factor. We present approximations to this problem for antennae with angles ./2?≤?.?≤?2..作者: 威脅你 時間: 2025-3-27 23:03 作者: Onerous 時間: 2025-3-28 03:57 作者: Canary 時間: 2025-3-28 06:30 作者: 平淡而無味 時間: 2025-3-28 11:28
Load-Balanced Virtual Backbone Construction for Wireless Sensor Networks,ed VBs are competitive approaches among the existing methods used to establish VBs in WSNs. Most existing works focus on constructing Minimum-sized CDSs (MCDSs). However, few works consider the load-balance factor. In this work, the size and the load-balance factor are both taken into account when c作者: 易改變 時間: 2025-3-28 18:07
Maximum Matching in Multi-Interface Networks, several connections might be established. That is, the devices at the endpoints of each connection share at least one active interface..In this paper, we consider the standard matching problem in the context of multi-interface wireless networks. The aim is to maximize the number of parallel connect作者: 招惹 時間: 2025-3-28 19:54
Stretch Factor in Wireless Sensor Networks with Directional Antennae,as been some recent study using a model where sensors transmit using a directional antenna. This study has focused on the problem of finding an optimal transmission range so that there exists an orientation of the antennae at each sensor which creates a strongly connected communication network. This作者: Amylase 時間: 2025-3-29 02:45
On the Minimum Diameter Cost-Constrained Steiner Tree Problem,and a given constant C.?≥?0, the aim is to find a minimum diameter Steiner tree whose all terminals appear as leaves and the cost of tree is bounded by C.. The diameter of tree refers to the maximum weight of the paths connecting two different leaves in the tree. This problem is called the minimum d作者: Explosive 時間: 2025-3-29 06:18
On Zero Forcing Number of Permutation Graphs, after finitely many applications of “the color-change rule”: a white vertex is converted black if it is the only white neighbor of a black vertex. Zero forcing number was introduced and used to bound the minimum rank of graphs by the “AIM Minimum Rank – Special Graphs Work Group”. Let .. and .. be 作者: 歸功于 時間: 2025-3-29 07:42 作者: Constituent 時間: 2025-3-29 13:51 作者: 抵消 時間: 2025-3-29 16:57 作者: ferment 時間: 2025-3-29 21:14
Crossing Angles of Geometric Graphs,between crossing edges in a straight line drawing of .. We show that an .-vertex graph . with can(.)?=?.(1) has .(.) edges, but there are graphs . with bounded degree and arbitrarily large can(.). We also initiate studying the . of geometric graphs. We construct bounded degree graphs .?=?(.,.) such 作者: 四目在模仿 時間: 2025-3-30 03:10 作者: NIP 時間: 2025-3-30 07:32
Radiation Hybrid Map Construction Problem Parameterized,lem is known to be .-complete even when all gene clusters are of size two and the corresponding problem (..) admits efficient constant-factor approximation algorithms. In this paper, for the first time, we consider the more general case when the gene clusters can have size either two or three (..). 作者: 陰郁 時間: 2025-3-30 09:12
On the Central Path Problem, 2D space, find a curve ., called ., that best represents all curves in .. In order for . to best represent ., . is required to minimize the maximum distance (measured by the directed Hausdorff distance) to all curves in . and is the locus of the center of minimal spanning disk of .. For the CPP pro作者: Offensive 時間: 2025-3-30 13:12 作者: judiciousness 時間: 2025-3-30 20:24
Algorithms for Forest Local Similarity,lled trees. Given two ordered labelled forests . and ., the . is to find two sub-forests .′ and .′ of . and . respectively such that they are the most similar over all possible .′ and .′. In this paper, we present efficient algorithms for the local forest similarity problem for two types of sub-fore作者: 單獨 時間: 2025-3-30 23:25
Speedup of RNA Pseudoknotted Secondary Structure Recurrence Computation with the Four-Russians Meth cells and viral RNA [1]. Restricting the class of possible structures and then finding the optimal structure for that restricted class is a common method employed to deal with the computational complexity..We derive a practical and worst-case speedup algorithm using the Four-Russians method for the作者: 冰河期 時間: 2025-3-31 02:43 作者: 男生如果明白 時間: 2025-3-31 05:59
The ,-Matching Problem in Hypergraphs: Hardness and Approximability,is defined as follows: for given .?∈?? and a hypergraph . a subset . with maximum cardinality is sought so that no vertex is contained in more than . hyperedges of ... We show that if the maximum degree of the vertices is bounded by a constant .?∈?? , this problem has no approximation scheme, unless作者: Libido 時間: 2025-3-31 13:10
Resource Scheduling with Supply Constraint and Linear Cost,t, and . jobs, each requiring an arbitrary number .. of resources. Each resource can only be assigned to one job. The objective is to find a schedule that minimizes ∑?...., where .. is the weight/importance of job .. and .. is the time that job .. receives all resources it requires. We show this pro作者: critic 時間: 2025-3-31 14:31
Basel Hasan,Ali Amin Rezaei,Jorge Marx GómezWe suggest the notion of the surface area centered at an edge for an interconnection network, which generalizes the usual notion of surface area of a network centered at a vertex. Following an elementary approach, we derive an explicit expression of the edge-centered surface area of the arrangement graph.作者: 調(diào)味品 時間: 2025-3-31 19:35 作者: ensemble 時間: 2025-3-31 22:39 作者: upstart 時間: 2025-4-1 03:13
Conference proceedings 2012 revised papers including one invited talk and one keynote talk were carefully reviewed and selected from 57 submissions. The papers are focused to theoretical results and also on recent works on experimental and applied research of general algorithmic interest.作者: 強所 時間: 2025-4-1 06:42
