標(biāo)題: Titlebook: Computing and Combinatorics; 27th International C Chi-Yeh Chen,Wing-Kai Hon,Chia-Wei Lee Conference proceedings 2021 Springer Nature Switze [打印本頁(yè)] 作者: Negate 時(shí)間: 2025-3-21 17:51
書(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é)科排名
作者: brother 時(shí)間: 2025-3-21 20:40 作者: 輪流 時(shí)間: 2025-3-22 00:51
On the Approximation Hardness of Geodetic Set and Its Variantse this problem. Then, we show that there is no . polynomial-time approximation algorithm for edge geodetic number and strong geodetic number on subcubic bipartite graphs with arbitrarily high girth. We also prove that geodetic number and edge geodetic number are both LOG-.-hard, even on subcubic bip作者: 起草 時(shí)間: 2025-3-22 08:13 作者: 玉米棒子 時(shí)間: 2025-3-22 08:52 作者: Chandelier 時(shí)間: 2025-3-22 12:58 作者: Chandelier 時(shí)間: 2025-3-22 17:25
https://doi.org/10.1007/978-1-4020-9247-3n of the graphs used to construct the generator; this encompasses all prior analyses of the INW generator. Our lower bound matches the upper bound of Braverman–Rao–Raz–Yehudayoff (FOCS 2010, SICOMP 2014) for regular branching programs of alphabet size . except for a gap between their . term and our 作者: Antimicrobial 時(shí)間: 2025-3-22 22:22 作者: Hypomania 時(shí)間: 2025-3-23 02:46
Thermal System Design and Optimizatione this problem. Then, we show that there is no . polynomial-time approximation algorithm for edge geodetic number and strong geodetic number on subcubic bipartite graphs with arbitrarily high girth. We also prove that geodetic number and edge geodetic number are both LOG-.-hard, even on subcubic bip作者: 沖擊力 時(shí)間: 2025-3-23 05:47
,Optimization—Basic Ideas and?Formulation,ace bound of Thorup and Zwick..It is not known, however, whether graph sparsity can help to get a stretch which is better than . using only . space. In this paper we answer this open question and prove a separation between sparse and dense graphs by showing that using sparsity it is possible to obta作者: BALK 時(shí)間: 2025-3-23 10:22 作者: gout109 時(shí)間: 2025-3-23 15:06
Molecular Dynamics Simulations,automata. We characterize . in terms of a new machine model, called logarithmic-space deterministic auxiliary depth-. storage automata that run in polynomial time. These machine are also shown to be as powerful as a polynomial-time two-way multi-head deterministic depth-. storage automata.作者: ODIUM 時(shí)間: 2025-3-23 18:18
Computing and Combinatorics978-3-030-89543-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Mendicant 時(shí)間: 2025-3-24 02:14
https://doi.org/10.1007/978-3-030-89543-3algorithm analysis and problem complexity; algorithm design; approximation algorithms; approximation th作者: calorie 時(shí)間: 2025-3-24 02:45
978-3-030-89542-6Springer Nature Switzerland AG 2021作者: 饒舌的人 時(shí)間: 2025-3-24 09:36
https://doi.org/10.1007/978-1-4020-9247-3dered branching programs of length ., width ., and alphabet size . to within error .. A series of works have shown that the analysis of the INW generator can be improved for the class of . branching programs or the more general . branching programs, improving the . dependence on the length . to . or作者: Admire 時(shí)間: 2025-3-24 12:12 作者: 粘連 時(shí)間: 2025-3-24 15:44
Linear Programming and Dynamic Programming,(LIS) problem and the longest common subsequence (LCS) problem. In this paper, we propose an algorithm that finds every LCIS of two sequences .,?. of length . in . time and space, where . denotes the size of the alphabet set and . the total number of increasing subsequences contained in . (thus, the作者: 捐助 時(shí)間: 2025-3-24 19:54 作者: capsaicin 時(shí)間: 2025-3-25 01:41
https://doi.org/10.1007/978-3-030-59046-8It is the first greedy algorithm for exhaustively generating spanning trees using such a minimal change operation. The resulting listing is then studied to find a recursive algorithm that produces the same listing in .(1)-amortized time using .(.) space. Additionally, we present .(.)-time algorithms作者: 字的誤用 時(shí)間: 2025-3-25 03:29
Nontraditional Optimization Techniques,r own utilities for the resources, and the goal is to find an assignment that maximizes the minimum total utility of resources assigned to a player. We introduce an over-estimation strategy to help overcome the challenges of each resource having different utilities for different players. When all re作者: Inkling 時(shí)間: 2025-3-25 07:33 作者: 會(huì)犯錯(cuò)誤 時(shí)間: 2025-3-25 13:46 作者: amplitude 時(shí)間: 2025-3-25 17:56 作者: 橡子 時(shí)間: 2025-3-25 20:31
Molecular Dynamics Simulations,gative priority .(.). The goal is to compute a minimum weight Steiner tree containing edges of varying rates such that the path from . to each terminal . consists of edges of rate greater than or equal to .(.). The PST problem with . priorities admits a .-approximation [Charikar et al., 2004], and i作者: 死貓他燒焦 時(shí)間: 2025-3-26 02:57 作者: nitroglycerin 時(shí)間: 2025-3-26 05:23 作者: 確定方向 時(shí)間: 2025-3-26 09:08
Molecular Dynamics Simulations,nt baselines. Sequence graphs are the natural structures encoding their information. However, a sequence graph may have several realizations as a sequence, leading to a degree of ambiguity. In this paper, we study such degree of ambiguity from a combinatorial and computational point of view. In part作者: Abjure 時(shí)間: 2025-3-26 13:34
Molecular Dynamics Simulations,died in depth from an aspect of parallel computability because it is nicely situated between . and .. By changing a memory device from pushdown stacks to access-controlled storage tapes, we introduce a computational model of deterministic depth-. storage automata (.-sda’s) whose tape cells are freel作者: mendacity 時(shí)間: 2025-3-26 17:01 作者: 平項(xiàng)山 時(shí)間: 2025-3-27 00:31
Molecular Dynamics Simulations,tenations of two similar strings, and prove non-context-freeness of these languages. We consider the Hamming distance and the edit-distance for the error measure of the two similar strings in pseudo-copy languages. When the error has an upper bound or a fixed value, we show that the pseudo-copy lang作者: remission 時(shí)間: 2025-3-27 03:09
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/234765.jpg作者: 全面 時(shí)間: 2025-3-27 08:42
Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching dered branching programs of length ., width ., and alphabet size . to within error .. A series of works have shown that the analysis of the INW generator can be improved for the class of . branching programs or the more general . branching programs, improving the . dependence on the length . to . or作者: Offensive 時(shí)間: 2025-3-27 12:28
All-to-All Broadcast in Dragonfly Networksach router to all routers. Two different all-to-all broadcast algorithms GFA2A and RFA2A using the previous group-first and router-first one-to-all broadcast schemes are presented. A new all-to-all broadcast algorithm named A2A is presented by collecting all messages from all routers in the same gro作者: deactivate 時(shí)間: 2025-3-27 13:49
An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences(LIS) problem and the longest common subsequence (LCS) problem. In this paper, we propose an algorithm that finds every LCIS of two sequences .,?. of length . in . time and space, where . denotes the size of the alphabet set and . the total number of increasing subsequences contained in . (thus, the作者: Dawdle 時(shí)間: 2025-3-27 18:21 作者: hemoglobin 時(shí)間: 2025-3-27 23:54 作者: COWER 時(shí)間: 2025-3-28 03:49
General Max-Min Fair Allocationr own utilities for the resources, and the goal is to find an assignment that maximizes the minimum total utility of resources assigned to a player. We introduce an over-estimation strategy to help overcome the challenges of each resource having different utilities for different players. When all re作者: 蜈蚣 時(shí)間: 2025-3-28 08:10
On the Approximation Hardness of Geodetic Set and Its Variantspath between two vertices of the subset. A strong geodetic set is a subset S of vertices and a choice of a shortest path for every pair of vertices of S such that every vertex is on one of these shortest paths. The geodetic number (resp. edge geodetic number) of a graph is the minimum size of a geod作者: ethnology 時(shí)間: 2025-3-28 13:15 作者: stress-response 時(shí)間: 2025-3-28 16:38
Hardness and Approximation Results of?Roman {3}-Domination in Graphsn . and if ., then .. The weight, .(.), of a Roman {3}-dominating function . is .. The minimum weight of a Roman .-dominating function in a graph . is known as . .-. of . and is denoted by .. . .-. problem is to find a Roman .-dominating function of minimum weight and . .-. is the decision version o作者: 松緊帶 時(shí)間: 2025-3-28 21:41 作者: 繁忙 時(shí)間: 2025-3-29 00:40 作者: mediocrity 時(shí)間: 2025-3-29 03:53 作者: 領(lǐng)先 時(shí)間: 2025-3-29 10:19
Sequence Graphs Realizations and Ambiguity in Language Modelsnt baselines. Sequence graphs are the natural structures encoding their information. However, a sequence graph may have several realizations as a sequence, leading to a degree of ambiguity. In this paper, we study such degree of ambiguity from a combinatorial and computational point of view. In part作者: 捕鯨魚(yú)叉 時(shí)間: 2025-3-29 11:41
Between SC and LOGDCFL: Families of Languages Accepted by Polynomial-Time Logarithmic-Space Determindied in depth from an aspect of parallel computability because it is nicely situated between . and .. By changing a memory device from pushdown stacks to access-controlled storage tapes, we introduce a computational model of deterministic depth-. storage automata (.-sda’s) whose tape cells are freel作者: 颶風(fēng) 時(shí)間: 2025-3-29 16:45
Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small show that intersecting a given constraint language with an ideal language does not increase the computational complexity. Additionally, we state a theorem giving .-hardness that broadly generalizes previously used constructions and a result on how to combine languages by concatenation to get polyno作者: Preserve 時(shí)間: 2025-3-29 23:46 作者: oracle 時(shí)間: 2025-3-30 00:45
Conference proceedings 2021tober 2021...Due to the COVID-19 pandemic, COCOON 2021 was organized as a hybrid conference. ..The 56 papers presented in this volume were carefully reviewed and selected from 131 submissions. The papers are divided into the following topical sub-headings: algorithms, approximation algorithms, autom作者: 燕麥 時(shí)間: 2025-3-30 04:42 作者: ANT 時(shí)間: 2025-3-30 12:18
https://doi.org/10.1007/978-3-030-59046-8ed to find a recursive algorithm that produces the same listing in .(1)-amortized time using .(.) space. Additionally, we present .(.)-time algorithms for ranking and unranking the spanning trees for our listing; an improvement over the generic .-time algorithm for ranking and unranking spanning trees of an arbitrary graph.作者: 煤渣 時(shí)間: 2025-3-30 14:20 作者: 痛打 時(shí)間: 2025-3-30 17:47
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graphed to find a recursive algorithm that produces the same listing in .(1)-amortized time using .(.) space. Additionally, we present .(.)-time algorithms for ranking and unranking the spanning trees for our listing; an improvement over the generic .-time algorithm for ranking and unranking spanning trees of an arbitrary graph.作者: obnoxious 時(shí)間: 2025-3-30 21:39 作者: reptile 時(shí)間: 2025-3-31 03:42
Linear Programming and Dynamic Programming, running time is output-sensitive). Our algorithm employs the trie and some simple data structures, and thus is implementation-wise simple. In addition, it can be proved that our algorithm is optimal in time complexity when ..作者: 雀斑 時(shí)間: 2025-3-31 05:06
Thermal System Design and Optimization a partition equilibrium). To our knowledge, this is the strongest existence guarantee in the literature on congestion games when weakly-improving deviations are considered. Our proof technique gives the false impression of a potential function argument but it is a novel application of proof by contradiction.作者: SAGE 時(shí)間: 2025-3-31 12:45
Molecular Dynamics Simulations,uages are not context-free. Similarly, if the error has a lower bound of at least four, then such languages are not context-free, either. Finally, we prove that all these pseudo-copy languages are context-sensitive.作者: 有抱負(fù)者 時(shí)間: 2025-3-31 16:17 作者: exorbitant 時(shí)間: 2025-3-31 18:33
,Optimization—Basic Ideas and?Formulation,t . .-. problem is polynomial-time solvable for threshold graphs which is a subclass of chordal graphs. We propose an . approximation algorithm for . {3}-. problem for a graph . with maximum degree .. Finally, we show that . {3}-. problem is .-complete for bounded degree graphs.作者: lavish 時(shí)間: 2025-4-1 00:38 作者: GNAT 時(shí)間: 2025-4-1 04:59
