Algorithmica最新文献

Nearly Tight Spectral Sparsification of Directed Hypergraphs by a Simple Iterative Sampling Algorithm 基于简单迭代采样算法的有向超图近紧谱稀疏化

IF 1 4区计算机科学

Algorithmica Pub Date : 2026-10-16 DOI: 10.1007/s00453-026-01408-1

Kazusato Oko, Shinsaku Sakaue, Shin-ichi Tanigawa

{"title":"Nearly Tight Spectral Sparsification of Directed Hypergraphs by a Simple Iterative Sampling Algorithm","authors":"Kazusato Oko, Shinsaku Sakaue, Shin-ichi Tanigawa","doi":"10.1007/s00453-026-01408-1","DOIUrl":"10.1007/s00453-026-01408-1","url":null,"abstract":"<div>Spectral hypergraph sparsification, an attempt to extend well-known spectral graph sparsification to hypergraphs, has been extensively studied over the past few years. For undirected hypergraphs, Kapralov, Krauthgamer, Tardos, and Yoshida (2022) have proved an (varepsilon )-spectral sparsifier of the optimal (O^*(n)) size, where n is the number of vertices and (O^*) suppresses the (varepsilon ^{-1}) and (log n) factors. For directed hypergraphs, however, the optimal sparsifier size has not been known. Our main contribution is the first algorithm that constructs an (O^*(n^2))-size (varepsilon )-spectral sparsifier for a weighted directed hypergraph. Our result is optimal up to the (varepsilon ^{-1}) and (log n) factors since there is a lower bound of (Omega (n^2)) even for directed graphs. We also show the first non-trivial lower bound of (Omega (n^2/varepsilon )) for general directed hypergraphs. The basic idea of our algorithm is borrowed from the spanner-based sparsification for ordinary graphs by Koutis and Xu [30]. Their iterative sampling approach is indeed useful for designing sparsification algorithms in various circumstances. To demonstrate this, we also present a similar iterative sampling algorithm for undirected hypergraphs that attains one of the best size bounds, enjoys parallel implementation, and can be transformed to be fault-tolerant.</div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"88 6","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149189517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Maximum List r-Colorable Induced Subgraphs in (kP_3)-Free Graphs (kP_3) free图中的最大列表r-可着色诱导子图

IF 1 4区计算机科学

Algorithmica Pub Date : 2026-10-05 DOI: 10.1007/s00453-026-01410-7

Esther Galby, Paloma T. Lima, Andrea Munaro, Amir Nikabadi

{"title":"Maximum List r-Colorable Induced Subgraphs in (kP_3)-Free Graphs","authors":"Esther Galby, Paloma T. Lima, Andrea Munaro, Amir Nikabadi","doi":"10.1007/s00453-026-01410-7","DOIUrl":"10.1007/s00453-026-01410-7","url":null,"abstract":"<div>We show that, for every fixed positive integers r and k, Max-Weight List r-Colorable Induced Subgraph admits a polynomial-time algorithm on (kP_3)-free graphs. This problem is a common generalization of Max-Weight Independent Set, Odd Cycle Transversal and List r-Coloring, among others. Our result has several consequences. First, it implies that, for every fixed (r ge 5), assuming (textsf{P}ne textsf{NP}), Max-Weight List r-Colorable Induced Subgraph is polynomial-time solvable on H-free graphs if and only if H is an induced subgraph of either (kP_3) or (P_5+kP_1), for some (k ge 1). Second, it makes considerable progress toward a complexity dichotomy for Odd Cycle Transversal on H-free graphs, allowing to answer a question of Agrawal, Lima, Lokshtanov, Rzążewski, Saurabh, and Sharma [ACM Trans. Algorithms 2025]. Third, it gives a short and self-contained proof of the known result of Chudnovsky, Hajebi, and Spirkl [Combinatorica 2024] that List r-Coloring on (kP_3)-free graphs is polynomial-time solvable for every fixed r and k. We also consider two natural distance-d generalizations of Max-Weight Independent Set and List r-Coloring and provide polynomial-time algorithms on (kP_3)-free graphs for every fixed integers r, k, and (d ge 6).\u0000</div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"88 6","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149132308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Edge Multiway Cut and Node Multiway Cut are Hard for Planar Subcubic Graphs 边多路切割和节点多路切割是平面次三次图的难点

IF 1 4区计算机科学

Algorithmica Pub Date : 2026-10-03 DOI: 10.1007/s00453-026-01412-5

Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

{"title":"Edge Multiway Cut and Node Multiway Cut are Hard for Planar Subcubic Graphs","authors":"Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen","doi":"10.1007/s00453-026-01412-5","DOIUrl":"10.1007/s00453-026-01412-5","url":null,"abstract":"<div>It is known that the weighted version of Edge Multiway Cut (also known as Multiterminal Cut) is NP-complete on planar graphs of maximum degree 3. In contrast, for the unweighted version, NP-completeness is only known for planar graphs of maximum degree 11. In fact, the complexity of unweighted Edge Multiway Cut was open for graphs of maximum degree 3 for over twenty years. We prove that the unweighted version is NP-complete even for planar graphs of maximum degree 3. As weighted Edge Multiway Cut is polynomial-time solvable for graphs of maximum degree at most 2, we have now closed the complexity gap. We also prove that (unweighted) Node Multiway Cut (both with and without deletable terminals) is NP-complete for planar graphs of maximum degree 3. By combining our results with known results, we can apply two meta-classifications on graph containment from the literature. This yields full dichotomies for all three problems on (mathcal{H})-topological-minor-free graphs and, should (mathcal{H}) be finite, on (mathcal{H})-subgraph-free graphs as well. Previously, such dichotomies were only implied for (mathcal{H})-minor-free graphs.</div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"88 6","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00453-026-01412-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149132288","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs 用迭代舍入和计算机辅助证明逼近不相关机器加权完成时间

IF 1 4区计算机科学

Algorithmica Pub Date : 2026-10-03 DOI: 10.1007/s00453-026-01411-6

Shi Li

{"title":"Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs","authors":"Shi Li","doi":"10.1007/s00453-026-01411-6","DOIUrl":"10.1007/s00453-026-01411-6","url":null,"abstract":"<div>We revisit the unrelated machine scheduling problem with the weighted completion time objective. It is known that independent rounding achieves a 1.5 approximation for the problem, and many prior algorithms improve upon this ratio by leveraging strong negative correlation schemes. On each machine i, these schemes introduce strong negative correlation between events that some pairs of jobs are assigned to i, while maintaining non-positive correlation for all pairs. Our algorithm deviates from this methodology by relaxing the pairwise non-positive correlation requirement. On each machine i, we identify many groups of jobs. For a job j and a group B not containing j, we only enforce non-positive correlation between j and the group as a whole, allowing j to be positively-correlated with individual jobs in B. This relaxation suffices to maintain the 1.5-approximation, while enabling us to obtain a much stronger negative correlation within groups using an iterative rounding procedure: at most one job from each group is scheduled on i. We prove that the algorithm achieves a 1.36-approximation, improving upon the previous best approximation ratio of 1.4 due to Harris. While the improvement may not be substantial, the significance of our contribution lies in the relaxed non-positive correlation condition and the iterative rounding framework. Due to the simplicity of our algorithm, we are able to derive a closed form for the weighted completion time our algorithm achieves with a clean analysis. Unfortunately, we could not provide a good analytical analysis for the quantity; instead, we rely on a computer assisted proof. Nevertheless, the checking algorithm for the analysis is easy to implement, essentially involving evaluation of maximum values of single-variable quadratic functions over given intervals. Therefore, unlike previous results which use intricate analysis to optimize the final approximation ratio, we delegate this task to computer programs.\u0000</div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"88 6","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149132289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths 递减逼近全对最短路径的新权衡

IF 1 4区计算机科学

Algorithmica Pub Date : 2026-09-28 DOI: 10.1007/s00453-026-01407-2

Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos

{"title":"New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths","authors":"Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos","doi":"10.1007/s00453-026-01407-2","DOIUrl":"10.1007/s00453-026-01407-2","url":null,"abstract":"<div>We provide new tradeoffs between approximation and running time for the decremental all-pairs shortest paths (APSP) problem. For undirected graphs with m edges and n nodes undergoing edge deletions, we provide four new approximate decremental APSP algorithms, two for weighted and two for unweighted graphs. Our first result is ((2+ epsilon ))-APSP with total update time (tilde{O}(m^{1/2}n^{3/2})) (when (m= n^{1+c}) for any constant (0<c<1)). Our second result is ((2+epsilon , W_{u,v}))-APSP with total update time (tilde{O}(nm^{3/4})), where the second term is an additive stretch with respect to (W_{u,v}), the maximum weight on the current shortest path from u to v. Prior to our work the fastest algorithm for weighted graphs with approximation at most 3 had total (tilde{O}(mn)) update time for ((1+epsilon ))-APSP (Bernstein [11], SICOMP 2016). Our third result is ((2+ epsilon ))-APSP for unweighted graphs in (tilde{O}(m^{7/4})) update time, which for sparse graphs ((m=o(n^{8/7}))) is the first subquadratic ((2+epsilon ))-approximation. Our last result for unweighted graphs is ((1+epsilon , 2(k-1)))-APSP, for (k ge 2 ), with (tilde{O}(n^{2-1/k}m^{1/k})) total update time. For comparison, in the special case of ((1+epsilon , 2))-approximation, this improves over the state-of-the-art algorithm by Henzinger et al. [2], SICOMP 2016 with total update time of (tilde{O}(n^{2.5})). All of our results are randomized, work against an oblivious adversary, and have constant query time. \u0000</div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"88 6","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00453-026-01407-2.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149068012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Couples can be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples 夫妻可以是可处理的：医院/居民夫妻问题的新算法和硬度结果。

IF 1 4区计算机科学

Algorithmica Pub Date : 2026-09-14 DOI: 10.1007/s00453-026-01405-4

Gergely Csáji, David Manlove, Iain McBride, James Trimble

{"title":"Couples can be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples","authors":"Gergely Csáji, David Manlove, Iain McBride, James Trimble","doi":"10.1007/s00453-026-01405-4","DOIUrl":"10.1007/s00453-026-01405-4","url":null,"abstract":"<div>We study the Hospitals/Residents problem with Couples (hrc), where a solution is a stable matching or a report that none exists. We present a novel polynomial-time algorithm that can find a near-feasible stable matching, where hospitals’ capacities are adjusted by at most 1, in an hrc instance where the couples’ preferences are sub-responsive (i.e., if one member switches to a better hospital, then the couple also improves) and sub-complete (i.e., each pair of hospitals that are individually acceptable to both members are jointly acceptable for the couple) by reducing it to an instance of the Stable Fixtures problem. We further present a polynomial-time algorithm for hrc in a sub-responsive, sub-complete instance that is a Dual Market, or where all couples are one of several possible types. We show that our algorithm also implies the polynomial-time solvability of a stable b-matching problem, where the underlying graph is a multigraph with loops. We complement our algorithms with several hardness results. We show that hrc with sub-responsive and sub-complete couples is NP-hard, even with other strong restrictions. We further show that hrc with a Dual Market is NP-hard under several simultaneous restrictions. Finally, we show that the problem of finding a matching with the minimum number of blocking pairs in hrc is not approximable within (m^{1-varepsilon }), for any (varepsilon >0), where m is the total length of the hospitals’ preference lists, unless P=NP, even if each couple applies to only one pair of hospitals. Our polynomial-time solvability results greatly expand the class of known tractable instances of hrc and provide a useful tool for designing better and more efficient mechanisms in the future.\u0000</div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"88 5","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13574906/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148977985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

String problems in the congested clique model 拥塞团模型中的弦问题

IF 1 4区计算机科学

Algorithmica Pub Date : 2026-09-03 DOI: 10.1007/s00453-026-01406-3

Shay Golan, Matan Kraus

引用次数: 0

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number 图和字符串参数：路径宽度、切线宽度和局部性数之间的联系

IF 1 4区计算机科学

Algorithmica Pub Date : 2026-08-24 DOI: 10.1007/s00453-026-01404-5

Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid

{"title":"Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number","authors":"Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid","doi":"10.1007/s00453-026-01404-5","DOIUrl":"10.1007/s00453-026-01404-5","url":null,"abstract":"<div>We investigate the locality number, a recently introduced structural parameter for strings (with applications in pattern matching with variables), and its connection to two important graph-parameters, cutwidth and pathwidth. These connections allow us to show that computing the locality number is (textsf {NP})-hard, but fixed-parameter tractable, if parameterised by the locality number or by the alphabet size, which has been formulated as open problems in the literature. Moreover, the locality number can be approximated with ratio ({{,textrm{O},}}(sqrt{log ({{,mathrm{textsf {opt}},}})} log (n))). An important aspect of our work – that is relevant in its own right and of independent interest – is that we identify connections between the string parameter of the locality number on the one hand, and the famous graph parameters of cutwidth and pathwidth, on the other hand. These two parameters have been jointly investigated in the literature and are arguably among the most central graph parameters that are based on “linearisations” of graphs. In this way, we also identify a direct approximation preserving reduction from cutwidth to pathwidth, which shows that any polynomial (f({{,mathrm{textsf {opt}},}},|V|))-approximation algorithm for pathwidth yields a polynomial (2f(2{{,mathrm{textsf {opt}},}},h))-approximation algorithm for cutwidth on multigraphs (where h is the number of edges). In particular, this translates known approximation ratios for pathwidth into new approximation ratios for cutwidth, namely ({{,textrm{O},}}(sqrt{log ({{,mathrm{textsf {opt}},}})} log (h))) and ({{,textrm{O},}}(sqrt{log ({{,mathrm{textsf {opt}},}})} {{,mathrm{textsf {opt}},}})) for (multi) graphs with h edges.</div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"88 5","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00453-026-01404-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148837572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Why Dominance is Not Enough: Lessons from Practical Evolutionary Multi-objective Algorithms 为什么优势是不够的：来自实用进化多目标算法的教训

IF 1 4区计算机科学

Algorithmica Pub Date : 2026-08-20 DOI: 10.1007/s00453-026-01403-6

Duc-Cuong Dang, Andre Opris, Dirk Sudholt

{"title":"Why Dominance is Not Enough: Lessons from Practical Evolutionary Multi-objective Algorithms","authors":"Duc-Cuong Dang, Andre Opris, Dirk Sudholt","doi":"10.1007/s00453-026-01403-6","DOIUrl":"10.1007/s00453-026-01403-6","url":null,"abstract":"<div>Practical evolutionary multi-objective (EMO) algorithms like NSGA-II, NSGA-III, and SMS-EMOA combine the dominance relation with diversity criteria to identify promising solutions. Despite many success stories, their theoretical foundation remains underdeveloped, with key questions still unanswered–such as which information obtained during evolution is critical for their success. In this work, we explore the limitations of the information provided by the dominance relation between search points encountered so far. We present a large class of bi-objective problems whose Pareto-optimal set is small, while almost all pairs of search points are incomparable. On such problems, we prove that any black-box EMO algorithm that only relies on the dominance relation for making decisions fails spectacularly, requiring exponential time with high probability. In stark contrast, NSGA-II, NSGA-III, and SMS-EMOA efficiently cover the Pareto front in at most expected quadratic time by incorporating additional information from the objective values, such as crowding distances or hypervolume contributions of search points. Experiments conducted on randomly generated problems complement our theoretical findings. Our results highlight the superiority of practical EMO algorithms and the necessity of using information beyond dominance for effective multi-objective optimisation.</div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"88 5","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00453-026-01403-6.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148783094","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Approximate Monotone Local Search for Weighted Problems 加权问题的近似单调局部搜索

IF 1 4区计算机科学

Algorithmica Pub Date : 2026-08-18 DOI: 10.1007/s00453-026-01402-7

Barış Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma

{"title":"Approximate Monotone Local Search for Weighted Problems","authors":"Barış Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma","doi":"10.1007/s00453-026-01402-7","DOIUrl":"10.1007/s00453-026-01402-7","url":null,"abstract":"<div>In a recent work, Esmer et al. describe a simple method – approximate monotone local search – to obtain exponential approximation algorithms from existing parameterized exact algorithms, polynomial-time approximation algorithms and, more generally, parameterized approximation algorithms. In this work, we generalize those results to the weighted setting. More formally, we consider monotone subset minimization problems over a weighted universe of size n (e.g., Vertex Cover, d-Hitting Set and Feedback Vertex Set). We consider a model where the algorithm is only given access to a subroutine that finds a solution of weight at most (alpha cdot W) (and of arbitrary cardinality) in time (c^k cdot n^{mathcal {O}(1)}) where W is the minimum weight of a solution of cardinality at most k. In the unweighted setting, Esmer et al. determine the smallest value d for which a (beta )-approximation algorithm running in time (d^{n + o(n)}) can be obtained in this model. We show that the same dependencies also hold in a weighted setting in this model: we obtain a (beta )-approximation algorithm running in time (d^{n + o(n)}), for the same d as in the unweighted setting. Similarly, we also extend a (beta )-approximate brute-force search (in a model which only provides access to a membership oracle) to the weighted setting. Using existing approximation algorithms and exact parameterized algorithms for weighted problems, we obtain the first exponential-time (beta )-approximation algorithms that are better than brute force for a variety of problems including Weighted Vertex Cover, Weighted d-Hitting Set, Weighted Feedback Vertex Set and Weighted Multicut.</div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"88 5","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00453-026-01402-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148752410","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0