Theor. Comput. Sci.最新文献_第8页

Characterizing Attributed Tree Translations in Terms of Macro Tree Transducers 用宏树换能器描述属性树翻译

Theor. Comput. Sci. Pub Date : 2022-09-15 DOI: 10.48550/arXiv.2209.07090

Kenji Hashimoto, S. Maneth

引用次数: 0

Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning 几个错误边界在线学习模型的强盗反馈价格的尖锐界限

Theor. Comput. Sci. Pub Date : 2022-09-03 DOI: 10.48550/arXiv.2209.01366

R. Feng, Jesse T. Geneson, Andrew Lee, Espen Slettnes

引用次数: 0

On the recognition of search trees generated by BFS and DFS 基于BFS和DFS的搜索树识别研究

Theor. Comput. Sci. Pub Date : 2022-09-01 DOI: 10.1016/j.tcs.2022.09.018

R. Scheffler

引用次数: 3

Colored Cut Games 彩色切割游戏

Theor. Comput. Sci. Pub Date : 2022-09-01 DOI: 10.4230/LIPIcs.FSTTCS.2020.30

Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer

{"title":"Colored Cut Games","authors":"Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer","doi":"10.4230/LIPIcs.FSTTCS.2020.30","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2020.30","url":null,"abstract":"In a graph G = (V,E) with an edge coloring ` : E → C and two distinguished vertices s and t, a colored (s, t)-cut is a set C̃ ⊆ C such that deleting all edges with some color c ∈ C̃ from G disconnects s and t. Motivated by applications in the design of robust networks, we introduce a family of problems called colored cut games. In these games, an attacker and a defender choose colors to delete and to protect, respectively, in an alternating fashion. It is the goal of the attacker to achieve a colored (s, t)-cut and the goal of the defender to prevent this. First, we show that for an unbounded number of alternations, colored cut games are PSPACE-complete. We then show that, even on subcubic graphs, colored cut games with a constant number i of alternations are complete for classes in the polynomial hierarchy whose level depends on i. To complete the dichotomy, we show that all colored cut games are polynomial-time solvable on graphs with degree at most two. Finally, we show that all colored cut games admit a polynomial kernel for the parameter k + κr where k denotes the total attacker budget and, for any constant r, κr is the number of vertex deletions that are necessary to transform G into a graph where the longest path has length at most r. In the case of r = 1, κ1 is the vertex cover number vc of the input graph and we obtain a kernel with O(vc2k2) edges. Moreover, we introduce an algorithm solving the most basic colored cut game, Colored (s, t)-Cut, in 2vc+knO(1) time. 2012 ACM Subject Classification Theory of computation → Parameterized complexity and exact algorithms; Theory of computation → Graph algorithms analysis; Theory of computation → Problems, reductions and completeness","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"1 1","pages":"13-32"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83082284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems 组合瓶颈问题敏感性分析中公差的高效计算

Theor. Comput. Sci. Pub Date : 2022-09-01 DOI: 10.1016/j.tcs.2022.09.026

Marcel Turkensteen, G. Jäger

引用次数: 0

On the 2-abelian complexity of generalized Cantor sequences 广义康托序列的2-阿贝尔复杂度

Theor. Comput. Sci. Pub Date : 2022-09-01 DOI: 10.1016/j.tcs.2022.09.025

Xiaotao Lü, Jin Chen, Zhi-Xiong Wen

引用次数: 0

Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice 整数格上背包约束下单调非次模函数最大化的流算法

Theor. Comput. Sci. Pub Date : 2022-09-01 DOI: 10.1016/j.tcs.2022.09.028

Jing-jing Tan, Fengmin Wang, Weina Ye, Xiaoqing Zhang, Yang Zhou