標題: Titlebook: Algorithmsand Complexity; 12th International C Tiziana Calamoneri,Federico Corò Conference proceedings 2021 Springer Nature Switzerland AG [打印本頁] 作者: SCOWL 時間: 2025-3-21 17:21
書目名稱Algorithmsand Complexity影響因子(影響力)
書目名稱Algorithmsand Complexity影響因子(影響力)學科排名
書目名稱Algorithmsand Complexity網(wǎng)絡公開度
書目名稱Algorithmsand Complexity網(wǎng)絡公開度學科排名
書目名稱Algorithmsand Complexity被引頻次
書目名稱Algorithmsand Complexity被引頻次學科排名
書目名稱Algorithmsand Complexity年度引用
書目名稱Algorithmsand Complexity年度引用學科排名
書目名稱Algorithmsand Complexity讀者反饋
書目名稱Algorithmsand Complexity讀者反饋學科排名
作者: 原始 時間: 2025-3-21 21:44
Distributed Distance-, Covering Problems on Sparse High-Girth Graphsems admit constant factor approximations in the CONGEST model of distributed computing in a . number of rounds on classes of sparse high-girth graphs. In this paper, sparse means bounded expansion, and high-girth means girth at least .. Our algorithm is quite simple; however, the proof of its approx作者: Vertebra 時間: 2025-3-22 02:20 作者: 清澈 時間: 2025-3-22 07:29 作者: 悲痛 時間: 2025-3-22 12:06 作者: Ventilator 時間: 2025-3-22 16:39 作者: 太空 時間: 2025-3-22 18:27
Upper Tail Analysis of Bucket Sort and Random TriesThe analysis holds even when a quadratic time algorithm is used to sort the keys in each bucket. We show how to obtain linear time guarantees on the running time of Bucket Sort that hold with .. Specifically, we investigate the asymptotic behavior of the exponent in the upper tail probability of the作者: Recess 時間: 2025-3-22 23:15
Throughput Scheduling with Equal Additive Laxity time ., a deadline ., and possibly a weight. The jobs have to be scheduled non-preemptively on . identical parallel machines. The goal is to find a schedule for a subset of jobs of maximum cardinality (or maximum total weight) that start and finish within their feasible time window?.. In our specia作者: Brain-Waves 時間: 2025-3-23 03:17 作者: 大溝 時間: 2025-3-23 07:43
FPT and Kernelization Algorithms for the Induced Tree Problemresented the first polynomial time algorithm for this problem, which has become a critical subroutine in many algorithms for detecting induced subgraphs, such as beetles, pyramids, thetas, and even and odd-holes. In 2007, Derhy and Picouleau [Discrete Applied Mathematics, 2009] considered the natura作者: Magnitude 時間: 2025-3-23 13:13
The Multi-budget Maximum Weighted Coverage Problemset . of bins where any . is a subset of elements of .. Each bin . has its own cost, and each element its own weight. An outcome is a vector . where each budget ., for ., can be used to buy a subset of bins . of overall cost at most .. The objective is to maximize the total weight which is defined a作者: Encapsulate 時間: 2025-3-23 15:22
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGspaths . in . such that . connects . to . for each .. Unlike their undirected counterparts which are FPT (parameterized by .) from Graph Minor theory, both the edge-disjoint and vertex-disjoint versions in directed graphs were shown by Fortune et al. (TCS ’80) to be NP-hard for .. This strong hardnes作者: 寵愛 時間: 2025-3-23 21:59 作者: Notify 時間: 2025-3-23 23:58
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineeringre the clusters shall be cliques, we focus on clusters that shall be 2-clubs, that is, subgraphs of diameter at most two. This naturally leads to the two NP-hard problems . (the editing operations are edge insertion and edge deletion) and . (the editing operations are vertex deletions). Answering an作者: 很是迷惑 時間: 2025-3-24 03:25 作者: 放縱 時間: 2025-3-24 08:56 作者: 漫不經(jīng)心 時間: 2025-3-24 11:34
,Das Kapital in der Wirtschaft Robinson’s,ordal graph has a vertex that intersects all longest paths (resp., longest cycles). It is an open problem [Balister et al., Comb. Probab. Comput. 2004] whether the same holds for chordal graphs. Similarly, we show that every connected well-partitioned chordal graph admits a (polynomial-time construc作者: 赦免 時間: 2025-3-24 18:07 作者: AWL 時間: 2025-3-24 21:27 作者: 松果 時間: 2025-3-25 01:05 作者: 象形文字 時間: 2025-3-25 06:01
https://doi.org/10.1007/978-3-642-50874-5 graph. Consider the following natural variant of the problem. Let . be a simple undirected graph of order .. Let . be a vector of vertex ., and let . be a vector of . at the vertices. Then . . . on . if the constraints . are satisfied for all ., where .(.) denotes the neighborhood of .. Given a req作者: jungle 時間: 2025-3-25 11:34
,Das Kapital in der Wirtschaft Robinson’s, that no two adjacent vertices are incident to the same sum of labels. In connection with recent optimisation variants of this conjecture, we study the role of label?3 in proper 3-labellings of graphs. Previous studies suggest that, in general, it should always be possible to produce proper 3-labell作者: Indurate 時間: 2025-3-25 12:45 作者: 少量 時間: 2025-3-25 16:46 作者: 簡潔 時間: 2025-3-25 22:31 作者: 環(huán)形 時間: 2025-3-26 02:54
https://doi.org/10.1007/978-3-322-98746-4resented the first polynomial time algorithm for this problem, which has become a critical subroutine in many algorithms for detecting induced subgraphs, such as beetles, pyramids, thetas, and even and odd-holes. In 2007, Derhy and Picouleau [Discrete Applied Mathematics, 2009] considered the natura作者: figure 時間: 2025-3-26 06:40
https://doi.org/10.1007/978-3-322-98746-4set . of bins where any . is a subset of elements of .. Each bin . has its own cost, and each element its own weight. An outcome is a vector . where each budget ., for ., can be used to buy a subset of bins . of overall cost at most .. The objective is to maximize the total weight which is defined a作者: 熱心 時間: 2025-3-26 11:01 作者: Circumscribe 時間: 2025-3-26 14:23 作者: BRUNT 時間: 2025-3-26 16:58 作者: 悠然 時間: 2025-3-27 01:02 作者: 思考而得 時間: 2025-3-27 01:47
Japan und das neue Zentralasien,o recognition of graph properties. Let . be an input graph with . vertices. We show that, if . is prime, then vertex-transitivity of . can be seen in a straightforward way from the output of . on . and on the vertex-individualized copies of .. This is perhaps the first non-trivial example of using t作者: addition 時間: 2025-3-27 07:55 作者: 排他 時間: 2025-3-27 13:23
978-3-030-75241-5Springer Nature Switzerland AG 2021作者: 作嘔 時間: 2025-3-27 17:03 作者: 結果 時間: 2025-3-27 17:51 作者: Canopy 時間: 2025-3-27 22:51
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153110.jpg作者: Allowance 時間: 2025-3-28 04:17
Algorithmsand Complexity978-3-030-75242-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Myelin 時間: 2025-3-28 07:18
,Das Kapital in der Wirtschaft Robinson’s,ansformation is always possible using at most . recombinations. (2) If . is Hamiltonian, the transformation is possible using .(.) recombinations for any ., and (3) we provide negative instances for .. (4) We show that the problem is PSPACE-complete when . and ., for any constant ., even for restric作者: 條約 時間: 2025-3-28 11:09
https://doi.org/10.1007/978-3-642-50874-5yclic graphs. However, checking the respective criteria is shown to be NP-hard..In the second part, we advance the study in general graphs. In [.] it was observed that any requirements vector . where . is even can be realized. For odd ., the question of whether . is realizable is framed as whether .作者: humectant 時間: 2025-3-28 17:47 作者: 遍及 時間: 2025-3-28 20:25
,Das Kapital in der Wirtschaft Robinson’s,in polynomial time. This contrasts the strong NP-hardness of the problem variant with arbitrary (and even equal multiplicative) laxity. Further, we give a fully polynomial-time approximation scheme for the weakly NP-hard weighted problem. Our single-machine algorithm can be used repeatedly to schedu作者: Abnormal 時間: 2025-3-29 00:27
,Das Kapital in der Wirtschaft Robinson’s, . is the number of increasing runs in a sequence. Deterministically finding the median has fragile complexity . and .. Deterministic sorting has fragile complexity . but it has fragile complexity . regardless of the number of runs.作者: deciduous 時間: 2025-3-29 03:53 作者: Binge-Drinking 時間: 2025-3-29 09:44 作者: FLAG 時間: 2025-3-29 11:39
Der Karriere-Kompass für Studierendeo .. We finally show that this time-approximation trade-off is tight, up?to an arbitrarily small constant in the second exponent: under the randomized ETH, and for any ratio . and ., no algorithm can output an .-approximation in time .. Hence, we completely characterize the approximability of the pr作者: 搖曳的微光 時間: 2025-3-29 18:23
,Kaspar Hauser — ein Opfer der Erziehung,letions. Nevertheless, we develop several effective data reduction and pruning rules, resulting in a competitive solver, outperforming a standard CPLEX solver in most instances of an established biological test data set.作者: originality 時間: 2025-3-29 22:33
Reconfiguration of Connected Graph Partitions via Recombinationansformation is always possible using at most . recombinations. (2) If . is Hamiltonian, the transformation is possible using .(.) recombinations for any ., and (3) we provide negative instances for .. (4) We show that the problem is PSPACE-complete when . and ., for any constant ., even for restric作者: 希望 時間: 2025-3-30 03:32
On Vertex-Weighted Graph Realizationsyclic graphs. However, checking the respective criteria is shown to be NP-hard..In the second part, we advance the study in general graphs. In [.] it was observed that any requirements vector . where . is even can be realized. For odd ., the question of whether . is realizable is framed as whether .作者: 騷擾 時間: 2025-3-30 04:53
Upper Tail Analysis of Bucket Sort and Random Triest, the probability that Bucket Sort takes . more time than expected is exponential in .. When a . algorithm is used to sort the keys in a bucket, the exponent becomes .. We prove this latter theorem by showing an upper bound on the tail of a random variable defined on tries, a result which we believ作者: faction 時間: 2025-3-30 10:09
Throughput Scheduling with Equal Additive Laxityin polynomial time. This contrasts the strong NP-hardness of the problem variant with arbitrary (and even equal multiplicative) laxity. Further, we give a fully polynomial-time approximation scheme for the weakly NP-hard weighted problem. Our single-machine algorithm can be used repeatedly to schedu作者: 蓋他為秘密 時間: 2025-3-30 15:17
Fragile Complexity of Adaptive Algorithms . is the number of increasing runs in a sequence. Deterministically finding the median has fragile complexity . and .. Deterministic sorting has fragile complexity . but it has fragile complexity . regardless of the number of runs.作者: thalamus 時間: 2025-3-30 19:54
FPT and Kernelization Algorithms for the Induced Tree Problem does not admit an . time algorithm. Afterwards, we use Courcelle’s Theorem to prove tractability under cliquewidth, which prompts our investigation into which parameterizations admit single exponential algorithms; we show that such algorithms exist for the unrelated parameterizations treewidth, dis作者: Brain-Waves 時間: 2025-3-30 23:25
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGsar if its underlying undirected graph is planar) directed graphs is unknown..???We resolve this gap by showing that . is W[1]-hard parameterized by the number . of terminal pairs, even when the input graph is a planar directed acyclic graph (DAG). This answers a question of Slivkins (ESA ’03, SIDMA 作者: 離開 時間: 2025-3-31 02:21
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximationo .. We finally show that this time-approximation trade-off is tight, up?to an arbitrarily small constant in the second exponent: under the randomized ETH, and for any ratio . and ., no algorithm can output an .-approximation in time .. Hence, we completely characterize the approximability of the pr作者: Isolate 時間: 2025-3-31 08:29
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineeringletions. Nevertheless, we develop several effective data reduction and pruning rules, resulting in a competitive solver, outperforming a standard CPLEX solver in most instances of an established biological test data set.作者: Ardent 時間: 2025-3-31 11:31
