標(biāo)題: Titlebook: Computing and Combinatorics; 26th International C Donghyun Kim,R. N. Uma,Dong Hoon Lee Conference proceedings 2020 Springer Nature Switzerl [打印本頁(yè)] 作者: ANNOY 時(shí)間: 2025-3-21 16:57
書(shū)目名稱(chēng)Computing and Combinatorics影響因子(影響力)
書(shū)目名稱(chēng)Computing and Combinatorics影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Computing and Combinatorics網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Computing and Combinatorics網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Computing and Combinatorics被引頻次
書(shū)目名稱(chēng)Computing and Combinatorics被引頻次學(xué)科排名
書(shū)目名稱(chēng)Computing and Combinatorics年度引用
書(shū)目名稱(chēng)Computing and Combinatorics年度引用學(xué)科排名
書(shū)目名稱(chēng)Computing and Combinatorics讀者反饋
書(shū)目名稱(chēng)Computing and Combinatorics讀者反饋學(xué)科排名
作者: 沒(méi)有希望 時(shí)間: 2025-3-21 20:30
Local Routing in a Tree Metric 1-Spanner,g metrics. In this paper, we present a simple local routing algorithm for this tree metric spanner. The algorithm has a routing ratio of 1, is guaranteed to terminate after . hops and requires . bits of storage per vertex where . is the maximum degree of the tree on which the spanner is constructed.作者: 相同 時(shí)間: 2025-3-22 01:13 作者: 補(bǔ)充 時(shí)間: 2025-3-22 08:07 作者: visual-cortex 時(shí)間: 2025-3-22 10:57
0302-9743 , USA, in August 2020.. Due to the COVID-19 pandemic COCOON 2020 was organized as a fully online conference. The 54 papers presented in this volume were carefully reviewed and selected from 126 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph t作者: disciplined 時(shí)間: 2025-3-22 13:38 作者: disciplined 時(shí)間: 2025-3-22 20:12
Thermal Runaway and Thermal Management,can be solved in linear time by a simpler algorithm on forests, and we determine the exact values for full .-ary trees. On the other hand, we show that . is .-complete even when the input graph is a split graph. We also show that the problem is hard to approximate within any constant factor better than 2, assuming the Unique Games Conjecture.作者: Vasoconstrictor 時(shí)間: 2025-3-22 23:53 作者: anticipate 時(shí)間: 2025-3-23 02:09 作者: 離開(kāi)真充足 時(shí)間: 2025-3-23 06:23
Konzeptuelle Prozessentwicklung,er of centers ., the highway dimension . and the pathwidth .?[.]. We extend their result and show that even if we additionally parameterize by the skeleton dimension ., the. problem remains W[1]-hard. Moreover, we prove that under the Exponential Time Hypothesis there is no exact algorithm for. that has runtime . for any computable function ..作者: Expostulate 時(shí)間: 2025-3-23 11:39
Linear-Time Algorithms for Eliminating Claws in Graphs,can be solved in linear time by a simpler algorithm on forests, and we determine the exact values for full .-ary trees. On the other hand, we show that . is .-complete even when the input graph is a split graph. We also show that the problem is hard to approximate within any constant factor better than 2, assuming the Unique Games Conjecture.作者: 信任 時(shí)間: 2025-3-23 17:25
Approaching Optimal Duplicate Detection in a Sliding Window,ally, we introduce a “queuing construction” that improves on the performance of some duplicate detection filters in the windowed setting..We also analyse the security of our filters in an adversarial setting.作者: affinity 時(shí)間: 2025-3-23 19:22 作者: champaign 時(shí)間: 2025-3-24 01:35 作者: implore 時(shí)間: 2025-3-24 02:55
Conference proceedings 2020ly reviewed and selected from 126 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph theory, complexity theory, problem solving, optimization, computational biology, computational learning, communication network, logic, and game theory..作者: Glucocorticoids 時(shí)間: 2025-3-24 07:02 作者: 隼鷹 時(shí)間: 2025-3-24 11:34 作者: evanescent 時(shí)間: 2025-3-24 14:52 作者: dapper 時(shí)間: 2025-3-24 22:40 作者: Rebate 時(shí)間: 2025-3-24 23:54
,Grundlagen der Ein- und Mehrphasenstr?mung,from humongous space consumption hindering their practicality for large real-world road networks. Our approach can be interpreted as a seamless interpolation between Contraction Hierarchies and Hub Labels.作者: APEX 時(shí)間: 2025-3-25 05:03
,Grundlagen der Ein- und Mehrphasenstr?mung,ces in ., . is the number of obstacles in ., . is the visibility polygon of . in . (. is the number of vertices of .), and . is the number of combinatorial changes in . due to the insertion (resp. deletion) of ..作者: Obedient 時(shí)間: 2025-3-25 08:32 作者: 阻擋 時(shí)間: 2025-3-25 12:44
End-Vertices of AT-free Bigraphs,on AT-free bigraphs. Additionally, we show that we can decide whether a vertex is an end-vertex of DFS or LBFS in linear time on AT-free bigraphs; this improves the LBFS end-vertex complexity on this class of graphs.作者: 撤退 時(shí)間: 2025-3-25 16:55
Seamless Interpolation Between Contraction Hierarchies and Hub Labels for Fast and Space-Efficient from humongous space consumption hindering their practicality for large real-world road networks. Our approach can be interpreted as a seamless interpolation between Contraction Hierarchies and Hub Labels.作者: Reclaim 時(shí)間: 2025-3-25 23:33
Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane,ces in ., . is the number of obstacles in ., . is the visibility polygon of . in . (. is the number of vertices of .), and . is the number of combinatorial changes in . due to the insertion (resp. deletion) of ..作者: 詞匯記憶方法 時(shí)間: 2025-3-26 03:29
Constructing Independent Spanning Trees in Alternating Group Networks,parent of one node in an IST is not determined by any rule. The correctness of the algorithm is verified, and the time complexity is analyzed. We use PHP to implement the algorithm and test cases from . to .. The testing results show that all trees are ISTs in all cases. We conclude that our algorithm is not only correct but also efficient.作者: 珍奇 時(shí)間: 2025-3-26 08:08
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/234766.jpg作者: 彩色 時(shí)間: 2025-3-26 12:20
Computing and Combinatorics978-3-030-58150-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 火光在搖曳 時(shí)間: 2025-3-26 15:02
https://doi.org/10.1007/0-387-29749-9ity graph of . with respect to .. As this graph can have unbounded degree, we modify it in three easy-to-follow steps, in order to bound the degree to 7 at the cost of slightly increasing the spanning ratio to 6.作者: 可能性 時(shí)間: 2025-3-26 16:48 作者: 大笑 時(shí)間: 2025-3-27 00:06 作者: absorbed 時(shí)間: 2025-3-27 05:03
Integrated Circuits and SystemsWe obtain a new lower bound for the eternal vertex cover number of an arbitrary graph ., in terms of the cardinality of a vertex cover of minimum size in . containing all its cut vertices. The consequences of the lower bound include a quadratic time algorithm for computing the eternal vertex cover number of chordal graphs.作者: Anticoagulant 時(shí)間: 2025-3-27 06:07 作者: Senescent 時(shí)間: 2025-3-27 11:08 作者: Lime石灰 時(shí)間: 2025-3-27 15:58 作者: Concrete 時(shí)間: 2025-3-27 18:20
Imbalance Parameterized by Twin Cover Revisited,the twin cover and the size of the largest clique outside the twin cover. In contrast, we introduce a notion of succinct representations of graphs in terms of their twin cover and demonstrate that . is NP-hard in the setting of succinct representations, even for graphs that have a twin cover of size one.作者: A簡(jiǎn)潔的 時(shí)間: 2025-3-28 01:20
Molecular Dynamics Simulations,sional linear subspace of . that minimizes the sum of squared distances to its nearest . points. More generally, the . subspace approximation problem with outliers minimizes the sum of .-th powers of distances instead of the sum of squared distances. Even the case of . or robust PCA is non-trivial, 作者: 起波瀾 時(shí)間: 2025-3-28 02:43 作者: acquisition 時(shí)間: 2025-3-28 09:38 作者: Mercantile 時(shí)間: 2025-3-28 11:13
Thermal Runaway and Thermal Management,ithm. We consider the end-vertex problem restricted to AT-free bigraphs for various search algorithms: Breadth-First Search (BFS), Lexicographic Breadth-First Search (LBFS), Depth-First Search (DFS), and Maximal Neighbourhood Search (MNS). Deciding whether a vertex of a graph is the end-vertex of an作者: objection 時(shí)間: 2025-3-28 16:46 作者: 報(bào)復(fù) 時(shí)間: 2025-3-28 21:32 作者: Benzodiazepines 時(shí)間: 2025-3-28 22:58
,Spezifische W?rme (experimenteller Teil),rrors is proportional to the blocklength, which goes to infinity. Without feedback, the asymptotic rate of error-correcting codes for the error fraction . is known to be zero. It was also proved that using the feedback a non-zero asymptotic rate can be achieved for the error fraction .. In this pape作者: 殘暴 時(shí)間: 2025-3-29 03:06 作者: Hyperlipidemia 時(shí)間: 2025-3-29 09:05 作者: hankering 時(shí)間: 2025-3-29 12:10 作者: 夾死提手勢(shì) 時(shí)間: 2025-3-29 15:41
Destillation, Rektifikation, Absorption,t there exist special complete parts of data which can still support answering related queries. However, as far as we know, there are only few works focusing on managing partial complete data. Therefore, efficient methods for representing partial complete data and deciding which queries can be answe作者: NIP 時(shí)間: 2025-3-29 20:10 作者: 噴油井 時(shí)間: 2025-3-30 01:20
Konzeptuelle Prozessentwicklung,The spanner has logarithmic lightness, logarithmic diameter, a linear number of edges and bounded degree (provided the input tree has bounded degree). This spanner has been applied in a series of papers devoted to designing bounded degree, low-diameter, low-weight .-spanners in Euclidean and doublin作者: inconceivable 時(shí)間: 2025-3-30 04:42 作者: exostosis 時(shí)間: 2025-3-30 08:25
https://doi.org/10.1007/3-540-28052-9ex-disjoint, they are independent spanning trees (ISTs). ISTs have numerous applications, such as secure message distribution and fault-tolerant broadcasting. The alternating group network . (. stands for the dimension) is a subclass of Cayley graphs, and the approach of constructing ISTs in . has n作者: habile 時(shí)間: 2025-3-30 15:51 作者: 舊石器時(shí)代 時(shí)間: 2025-3-30 18:33 作者: 口訣法 時(shí)間: 2025-3-30 23:37
,Bilanzierung, W?rme- und Stoffübertragung,raveling Salesman Problem and a few other NP-hard problems by combining in a novel way quantum search with classical dynamic programming. In this paper, we show how to apply this approach to the minimum Steiner tree problem, a well-known NP-hard problem, and construct the first quantum algorithm tha作者: 量被毀壞 時(shí)間: 2025-3-31 04:14
https://doi.org/10.1007/978-3-030-58150-3approximation algorithms; approximation theory; artificial intelligence; computer hardware; computer net作者: 錯(cuò) 時(shí)間: 2025-3-31 08:53 作者: 赤字 時(shí)間: 2025-3-31 10:40
Molecular Dynamics Simulations,mic results for robust subspace recovery require strong assumptions on the input, e.g., any . outliers must be linearly independent..In this paper, we show how to extend dimension reduction techniques and bi-criteria approximations based on sampling and coresets to the problem of subspace approximat作者: 抗生素 時(shí)間: 2025-3-31 13:53 作者: 貿(mào)易 時(shí)間: 2025-3-31 21:34 作者: Tincture 時(shí)間: 2025-3-31 22:31
Konzeptuelle Prozessentwicklung,esgue and Peano curves..Our main result is a lower bound of . on the competitive ratio of any Universal TSP tour using hierachical orderings. This is an improvement for this setting on the best known lower bound for Universal TSP on the plane for arbitrary orderings of . due to Hajiaghayi?. [., 649–作者: 小歌劇 時(shí)間: 2025-4-1 01:56
Subspace Approximation with Outliers,mic results for robust subspace recovery require strong assumptions on the input, e.g., any . outliers must be linearly independent..In this paper, we show how to extend dimension reduction techniques and bi-criteria approximations based on sampling and coresets to the problem of subspace approximat作者: neutrophils 時(shí)間: 2025-4-1 06:54 作者: 蠟燭 時(shí)間: 2025-4-1 12:36 作者: squander 時(shí)間: 2025-4-1 15:39
An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane,esgue and Peano curves..Our main result is a lower bound of . on the competitive ratio of any Universal TSP tour using hierachical orderings. This is an improvement for this setting on the best known lower bound for Universal TSP on the plane for arbitrary orderings of . due to Hajiaghayi?. [., 649–作者: 全能 時(shí)間: 2025-4-1 22:02 作者: fibula 時(shí)間: 2025-4-2 00:30
Linear-Time Algorithms for Eliminating Claws in Graphs, the distance of a given graph to a claw-free graph, considering vertex elimination as measure. . consists of determining the minimum number of vertices to be removed from a graph such that the resulting graph is claw-free. Although . is .-complete in general and recognizing claw-free graphs is stil作者: patriarch 時(shí)間: 2025-4-2 03:03
Bounded-Degree Spanners in the Presence of Polygonal Obstacles,ity graph of . with respect to .. As this graph can have unbounded degree, we modify it in three easy-to-follow steps, in order to bound the degree to 7 at the cost of slightly increasing the spanning ratio to 6.作者: refine 時(shí)間: 2025-4-2 08:41
