標(biāo)題: Titlebook: Combinatorial Optimization and Applications; 7th International Co Peter Widmayer,Yinfeng Xu,Binhai Zhu Conference proceedings 2013 Springer [打印本頁] 作者: charity 時(shí)間: 2025-3-21 19:31
書目名稱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é)科排名
作者: expdient 時(shí)間: 2025-3-22 00:05 作者: 健談 時(shí)間: 2025-3-22 03:15 作者: 散布 時(shí)間: 2025-3-22 05:05
https://doi.org/10.1007/978-3-319-03780-6approximation algorithms; computational complexity; dynamic programming; evolutionary algorithms; parall作者: browbeat 時(shí)間: 2025-3-22 11:11 作者: 確保 時(shí)間: 2025-3-22 16:04 作者: 確保 時(shí)間: 2025-3-22 20:50 作者: 誘騙 時(shí)間: 2025-3-22 21:52
Conference proceedings 2013 Chengdu, China, in December 2013. The 36 full papers presented were carefully reviewed and selected from 72 submissions. The papers feature original research in the areas of combinatorial optimization and its applications. In addition to theoretical results there are reports on experimental and applied research of general algorithmic interest.作者: 被告 時(shí)間: 2025-3-23 04:22
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229979.jpg作者: frozen-shoulder 時(shí)間: 2025-3-23 07:12
Smart Cities in the Gulf: An Overview?|.| is no less than a given number .. The algorithm runs in . time, where . (respectively, .) is the number of vertices (respectively, edges) in .. We then present a combinatorial approximation algorithm for the NP-hard problem of finding two disjoint matchings in a given edge-weighted graph . so t作者: 類人猿 時(shí)間: 2025-3-23 12:50 作者: 勤勞 時(shí)間: 2025-3-23 16:10 作者: 無動(dòng)于衷 時(shí)間: 2025-3-23 19:55 作者: 誘騙 時(shí)間: 2025-3-24 00:00 作者: Melanocytes 時(shí)間: 2025-3-24 05:53 作者: 騷擾 時(shí)間: 2025-3-24 08:25
Ashwin Kumar Balaji,Prashant Kumar Soorieodesic. For a function . defined on .(.) and .???.(.), let .(.)?=?∑?.(.). A function .: .(.)?→?[0,1] is a . of . if .(.{., .})?≥?1, for every pair of distinct vertices ., . of .. The ., .(.), of a graph . is min {.(.(.)): . is a strong resolving function of .}. For any connected graph . of order .?作者: helper-T-cells 時(shí)間: 2025-3-24 13:13
The Smart City: Build It and They Will Come,endences for each loop statement – is computed by means of basis dependence distance vectors derived from all vectors describing self-dependences. We demonstrate that the presented approach reduces the transitive closure calculation time for parameterized graphs representing all dependences in the l作者: 過濾 時(shí)間: 2025-3-24 17:24
Smart Cities of Today and Tomorrowin the complete relation information between individuals for complex structure and individual privacy. However, the social networks have communities. In our work, we aim at mining the invisible or missing relations between individuals within a community in social networks. We propose our algorithm a作者: pacific 時(shí)間: 2025-3-24 19:27
https://doi.org/10.1007/978-3-658-38969-7 .-time algorithm for finding a minimum feedback vertex set in an .-vertex undirected graph, which is the first exact algorithm for the problem that breaks the trivial barrier of 2.. Later, Fomin . (Algorithmica 2008) improved the result to 1.7548. .. In this paper, we further improve the result to 作者: 發(fā)炎 時(shí)間: 2025-3-24 23:25 作者: Latency 時(shí)間: 2025-3-25 03:33 作者: 發(fā)微光 時(shí)間: 2025-3-25 11:19 作者: 范例 時(shí)間: 2025-3-25 11:59
Matteo Sammarco,Marcin Detynieckiuch that the diameter of the set of chosen points is maximized. In this paper, we design an optimal .(. log.) time algorithm using rotating calipers for MaxDCS problem in the plane. Our algorithm can also be used to solve the maximum diameter problem of imprecise points modeled as polygons. We also 作者: 的事物 時(shí)間: 2025-3-25 17:46
Maha Elouni,Hesham A. Rakha,Youssef Bichiouzes conditions for secure communications with it. To do so, conditions of must-fail, might-fail and cannot-fail states are formalized and the number of cannot-fail states is discussed. Finally, an example is given to show how the extended strange planet protocol works.作者: Etymology 時(shí)間: 2025-3-25 23:37 作者: 全部逛商店 時(shí)間: 2025-3-26 04:02 作者: 職業(yè)拳擊手 時(shí)間: 2025-3-26 07:08 作者: 聲明 時(shí)間: 2025-3-26 11:51
Maha Elouni,Hesham A. Rakha,Youssef Bichiou the gene loss cost under the constraint of having the smallest gene duplication cost. As a part of a method for reconciling two non-binary trees, this algorithm has been implemented in a software package (http://phylotoo.appspot.com).作者: BROTH 時(shí)間: 2025-3-26 14:03 作者: entail 時(shí)間: 2025-3-26 18:00 作者: neutrophils 時(shí)間: 2025-3-26 23:10 作者: 相容 時(shí)間: 2025-3-27 03:02
Ashwin Kumar Balaji,Prashant Kumar Soori.?+?.)?≥?.(.) and show that .(.?+?.)???.(.) can be arbitrarily large. Lastly, we furnish a Nordhaus-Gaddum-type result: Let . and . (the complement of .) both be connected graphs of order .?≥?4; it is readily seen that . if and only if .?=?4; further, we characterize unicyclic graphs . attaining ..作者: crucial 時(shí)間: 2025-3-27 08:14
Smart Cities of Today and Tomorrowe first work that studies the problem of mining hidden links from the aspect of Nash Equilibrium. Eventually we confirm the superiority of our approach from extensive experiments over real-world social networks.作者: COUCH 時(shí)間: 2025-3-27 10:42
The Fractional Strong Metric Dimension of Graphs.?+?.)?≥?.(.) and show that .(.?+?.)???.(.) can be arbitrarily large. Lastly, we furnish a Nordhaus-Gaddum-type result: Let . and . (the complement of .) both be connected graphs of order .?≥?4; it is readily seen that . if and only if .?=?4; further, we characterize unicyclic graphs . attaining ..作者: GRILL 時(shí)間: 2025-3-27 15:21 作者: 過分 時(shí)間: 2025-3-27 19:47 作者: 發(fā)誓放棄 時(shí)間: 2025-3-27 21:55 作者: VAN 時(shí)間: 2025-3-28 04:10 作者: 吹牛者 時(shí)間: 2025-3-28 06:39 作者: 一條卷發(fā) 時(shí)間: 2025-3-28 13:26
https://doi.org/10.1007/978-3-658-38969-71.7356. .. Our algorithm is analyzed by using the measure-and-conquer method. After showing some properties of the problem, we get improvements by introducing a new measure scheme on the structure of reduced graphs.作者: gain631 時(shí)間: 2025-3-28 15:25
Approximation Algorithms for the Maximum Multiple RNA Interaction Problemthe problem when the order of interacting RNAs is known and pseudoknot interactions are allowed; for the general problem without an assumed RNA order, we prove the NP-hardness for both variants (allowing and disallowing pseudoknot interactions), and present a constant ratio approximation algorithm for each of them.作者: META 時(shí)間: 2025-3-28 20:26
On the Clustered Steiner Tree Problem case, in which . is the approximation ratio for the Steiner tree problem. When the topologies for all clusters are given, we show a (.?+?1)-approximation algorithm. We also discuss the Steiner ratio for this problem. We show the ratio is lower and upper bounded by three and four, respectively.作者: IVORY 時(shí)間: 2025-3-29 01:56
Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations oop in comparison with techniques implemented in the Omega and ISL libraries. This increases the applicability scope of techniques based on transitive closure of dependence graphs. Experimental results for NASA Parallel Benchmarks are discussed.作者: GEON 時(shí)間: 2025-3-29 07:03 作者: Eclampsia 時(shí)間: 2025-3-29 08:33 作者: Juvenile 時(shí)間: 2025-3-29 11:57 作者: 珊瑚 時(shí)間: 2025-3-29 18:54 作者: 馬籠頭 時(shí)間: 2025-3-29 23:46 作者: Fsh238 時(shí)間: 2025-3-30 03:10
Discretely Following a Curvesed on unique or non-unique nodes and on limiting the number of points used. We prove that three of the variations of the set-chain matching problem are .-complete. For the version of the problem that we prove is polynomial, we give the optimal substructure and the recurrence for a dynamic programming solution.作者: Insufficient 時(shí)間: 2025-3-30 06:31 作者: 隨意 時(shí)間: 2025-3-30 10:57 作者: 用樹皮 時(shí)間: 2025-3-30 12:33 作者: 跳動(dòng) 時(shí)間: 2025-3-30 20:01 作者: 柱廊 時(shí)間: 2025-3-31 00:34 作者: 華而不實(shí) 時(shí)間: 2025-3-31 03:14
Online Scheduling on Two Parallel Machines with Release Times and Delivery Times作者: 支柱 時(shí)間: 2025-3-31 07:18
Parallel Machine Scheduling with a Single Server: Loading and Unloading作者: amplitude 時(shí)間: 2025-3-31 12:36
Prompt Mechanism for Online Auctions with Multi-unit Demands作者: Offensive 時(shí)間: 2025-3-31 14:55
Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings?|.| is no less than a given number .. The algorithm runs in . time, where . (respectively, .) is the number of vertices (respectively, edges) in .. We then present a combinatorial approximation algorithm for the NP-hard problem of finding two disjoint matchings in a given edge-weighted graph . so t
