Algorithmica最新文献_第3页

Convex relaxation for the generalized maximum-entropy sampling problem 广义最大熵抽样问题的凸松弛

IF 0.7 4区计算机科学

Algorithmica Pub Date : 2026-02-17 DOI: 10.1007/s00453-026-01373-9

Gabriel Ponte, Marcia Fampa, Jon Lee

引用次数: 0

Concentration of Submodular Functions and Read-k Families Under Negative Dependence 负相关下子模函数与Read-k族的集中

IF 0.7 4区计算机科学

Algorithmica Pub Date : 2026-02-16 DOI: 10.1007/s00453-026-01372-w

Sharmila Duppala, George Z. Li, Juan Luque, Aravind Srinivasan, Renata Valieva

引用次数: 0

Block Crossings in One-Sided Tanglegrams 单侧缠结图中的块交叉

IF 0.7 4区计算机科学

Algorithmica Pub Date : 2026-02-07 DOI: 10.1007/s00453-025-01363-3

Alexander Dobler, Martin Nöllenburg

引用次数: 0

Rapid Mixing of Global Markov Chains via Spectral Independence: The Unbounded Degree Case 基于谱独立的全局马尔可夫链的快速混合：无界度情况

IF 0.7 4区计算机科学

Algorithmica Pub Date : 2026-01-14 DOI: 10.1007/s00453-025-01353-5

Antonio Blanca, Xusheng Zhang

{"title":"Rapid Mixing of Global Markov Chains via Spectral Independence: The Unbounded Degree Case","authors":"Antonio Blanca, Xusheng Zhang","doi":"10.1007/s00453-025-01353-5","DOIUrl":"10.1007/s00453-025-01353-5","url":null,"abstract":"<div>We consider spin systems on general n-vertex graphs of unbounded degree and explore the effects of spectral independence on the rate of convergence to equilibrium of global Markov chains. Spectral independence is a novel way of quantifying the decay of correlations in spin system models, which has significantly advanced the study of Markov chains for spin systems. We prove that whenever spectral independence holds, the popular Swendsen–Wang dynamics for the q-state ferromagnetic Potts model on graphs of maximum degree (Delta ), where (Delta ) is allowed to grow with n, converges in (O((Delta log n)^c)) steps where (c > 0) is a constant independent of (Delta ) and n. We also show a similar mixing time bound for the block dynamics of general spin systems, again assuming that spectral independence holds. Finally, for monotone spin systems such as the Ising model and the hardcore model on bipartite graphs, we show that spectral independence implies that the mixing time of the systematic scan dynamics is (O(Delta ^c log n)) for a constant (c>0) independent of (Delta ) and n. Systematic scan dynamics are widely popular but are notoriously difficult to analyze. Our result implies optimal (O(log n)) mixing time bounds for any systematic scan dynamics of the ferromagnetic Ising model on general graphs up to the tree uniqueness threshold. Our main technical contribution is an improved factorization of the entropy functional: this is the common starting point for all our proofs. Specifically, we establish the so-called k-partite factorization of entropy with a constant that depends polynomially on the maximum degree of the graph.</div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"88 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2026-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00453-025-01353-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145983138","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

Strict Self-Assembly of Discrete Self-Similar Fractals in the Abstract Tile Assembly Model 抽象拼装模型中离散自相似分形的严格自拼装

IF 0.7 4区计算机科学

Algorithmica Pub Date : 2026-01-10 DOI: 10.1007/s00453-025-01340-w

Florent Becker, Daniel Hader, Matthew Patitz

{"title":"Strict Self-Assembly of Discrete Self-Similar Fractals in the Abstract Tile Assembly Model","authors":"Florent Becker, Daniel Hader, Matthew Patitz","doi":"10.1007/s00453-025-01340-w","DOIUrl":"10.1007/s00453-025-01340-w","url":null,"abstract":"<div>This paper answers a long-standing open question in tile-assembly theory, namely that it is possible to strictly assemble discrete self-similar fractals (DSSFs) in the abstract Tile-Assembly Model (aTAM). We prove this in 2 separate ways, each taking advantage of a novel set of tools. One of our constructions shows that specializing the notion of a quine, a program which prints its own output, to the language of tile-assembly naturally induces a fractal structure. The other construction introduces self-describing circuits as a means to abstractly represent the information flow through a tile-assembly construction and shows that such circuits may be constructed for a relative of the Sierpinski carpet, and indeed many other DSSFs, through a process of fixed-point iteration. This later result, or more specifically the machinery used in its construction, further enable us to provide a polynomial time procedure for deciding whether any given subset of (mathbb {Z}^2) will generate an aTAM producible DSSF. To this end, we also introduce the Tree Pump Theorem, a result analogous to the important Window Movie Lemma, but with requirements on the set of productions rather than on the self-assembling system itself. This paper is an extension of a version that appeared in the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’25).</div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"88 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2026-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00453-025-01340-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145930555","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

Plus Strategies are Exponentially Slower for Planted Optima of Random Height 对于随机高度的种植最优点，加号策略是指数级慢的

IF 0.7 4区计算机科学

Algorithmica Pub Date : 2026-01-09 DOI: 10.1007/s00453-025-01352-6

Johannes Lengler, Leon Schiller, Oliver Sieberling

引用次数: 0

Maximum Independent Set when Excluding an Induced Minor: (K_1 + tK_2) and (tC_3 uplus C_4) 排除诱导未成年人时的最大独立集：(K_1 + tK_2)和 (tC_3 uplus C_4)

IF 0.7 4区计算机科学

Algorithmica Pub Date : 2025-12-23 DOI: 10.1007/s00453-025-01356-2

Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek

{"title":"Maximum Independent Set when Excluding an Induced Minor: (K_1 + tK_2) and (tC_3 uplus C_4)","authors":"Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek","doi":"10.1007/s00453-025-01356-2","DOIUrl":"10.1007/s00453-025-01356-2","url":null,"abstract":"<div>Dallard, Milanič, and Štorgel [arXiv ’22] ask if, for every class excluding a fixed planar graph H as an induced minor, Maximum Independent Set can be solved in polynomial time, and show that this is indeed the case when H is any planar complete bipartite graph, or the 5-vertex clique minus one edge, or minus two disjoint edges. A positive answer would constitute a far-reaching generalization of the state-of-the-art, when we currently do not know if a polynomial-time algorithm exists when H is the 7-vertex path. Relaxing tractability to the existence of a quasipolynomial-time algorithm, we know substantially more. Indeed, quasipolynomial-time algorithms were recently obtained for the t-vertex cycle, (C_t) [Gartland et al., STOC ’21], and the disjoint union of t triangles, (tC_3) [Bonamy et al., SODA ’23]. We give, for every integer t, a polynomial-time algorithm running in (n^{O(t^5)}) when H is the friendship graph (K_1 + tK_2) (t disjoint edges plus a vertex fully adjacent to them), and a quasipolynomial-time algorithm running in (n^{O(t^2 log n)+f(t)}), with f a single-exponential function, when H is (tC_3 uplus C_4) (the disjoint union of t triangles and a 4-vertex cycle). The former generalizes the algorithm readily obtained from Alekseev’s structural result on graphs excluding (tK_2) as an induced subgraph [Alekseev, DAM ’07], while the latter extends Bonamy et al.’s result.</div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"88 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145831446","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

Reconfiguration of Time-Respecting Arborescences 时变树形的重构

IF 0.7 4区计算机科学

Algorithmica Pub Date : 2025-12-22 DOI: 10.1007/s00453-025-01365-1

Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki

{"title":"Reconfiguration of Time-Respecting Arborescences","authors":"Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki","doi":"10.1007/s00453-025-01365-1","DOIUrl":"10.1007/s00453-025-01365-1","url":null,"abstract":"<div>An arborescence, which is a directed analogue of a spanning tree in an undirected graph, is one of the most fundamental combinatorial objects in a digraph. In this paper, we study arborescences in digraphs from the viewpoint of combinatorial reconfiguration, which is the field where we study reachability between two configurations of some combinatorial objects via some specified operations. Especially, we consider reconfiguration problems for time-respecting arborescences, which were introduced by Kempe, Kleinberg, and Kumar. We first prove that if the roots of the initial and target time-respecting arborescences are the same, then the target arborescence is always reachable from the initial one and we can find a shortest reconfiguration sequence in polynomial time. Furthermore, we show if the roots are not the same, then the target arborescence may not be reachable from the initial one. On the other hand, we show that we can determine whether the target arborescence is reachable from the initial one in polynomial time. Finally, we prove that it is NP-hard to find a shortest reconfiguration sequence in the case where the roots are not the same. Our results show an interesting contrast to the previous results for (ordinary) arborescences reconfiguration problems.</div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"88 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145831149","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

Oriented Spanners 面向扭力扳手

IF 0.7 4区计算机科学

Algorithmica Pub Date : 2025-12-11 DOI: 10.1007/s00453-025-01342-8

Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong

{"title":"Oriented Spanners","authors":"Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong","doi":"10.1007/s00453-025-01342-8","DOIUrl":"10.1007/s00453-025-01342-8","url":null,"abstract":"<div>Given a point set P in the Euclidean plane and a parameter t, we define an oriented t-spanner G as an oriented subgraph of the complete bi-directed graph such that for every pair of points, the shortest closed walk in G through those points is at most a factor t longer than the shortest cycle in the complete graph on P. We investigate the problem of computing sparse graphs with small oriented dilation. As we can show that minimising oriented dilation for a given number of edges is NP-hard in the plane, we first consider one-dimensional point sets. While obtaining a 1-spanner in this setting is straightforward, already for five points such a spanner has no plane embedding with the leftmost and rightmost point on the outer face. This leads to restricting to oriented graphs with a one-page book embedding on the one-dimensional point set. For this case we present a dynamic program to compute the graph of minimum oriented dilation that runs in (mathcal {O}(n^7)) time for n points, and a greedy algorithm that computes a 5-spanner in (mathcal {O}(nlog n)) time. Expanding these results finally gives us a result for two-dimensional point sets: we prove that for convex point sets the greedy triangulation results in a plane oriented t-spanner with (t=7.2 cdot t_g), where (t_g) is an upper bound on the dilation of the greedy triangulation.</div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"88 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00453-025-01342-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145729712","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

Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs 图中半径、直径和所有偏心率的P和次二次时间计算证明

IF 0.7 4区计算机科学

Algorithmica Pub Date : 2025-12-08 DOI: 10.1007/s00453-025-01344-6

Feodor Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot

{"title":"Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs","authors":"Feodor Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot","doi":"10.1007/s00453-025-01344-6","DOIUrl":"10.1007/s00453-025-01344-6","url":null,"abstract":"<div>In the context of fine-grained complexity, we investigate the notion of certificate enabling faster polynomial-time algorithms. We specifically target radius (minimum eccentricity), diameter (maximum eccentricity), and all-eccentricity computations for which quadratic-time lower bounds are known under plausible conjectures. In each case, we introduce a notion of certificate as a specific set of nodes from which appropriate bounds on all eccentricities can be derived in subquadratic time when this set has sublinear size. The existence of small certificates is a barrier against SETH-based lower bounds for these problems. We indeed prove that for graph classes with small certificates, there exist randomized subquadratic-time algorithms for computing the radius, the diameter, and all eccentricities respectively. Moreover, these notions of certificates are tightly related to algorithms probing the graph through one-to-all distance queries and allow to explain the efficiency of practical radius and diameter algorithms from the literature. Our formalization enables a novel primal-dual analysis of a classical approach for diameter computation that leads to algorithms for radius, diameter and all eccentricities with theoretical guarantees with respect to certain graph parameters. This is complemented by experimental results on various types of real-world graphs showing that these parameters appear to be low in practice. Finally, we obtain refined results for several graph classes.</div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"88 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145730127","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