International Workshop on Combinatorial Algorithms最新文献

Finding Small Complete Subgraphs Efficiently 高效地寻找小的完全子图

International Workshop on Combinatorial Algorithms Pub Date : 2023-08-22 DOI: 10.1007/978-3-031-34347-6_16

A. Dumitrescu, A. Lingas

引用次数: 0

Perfect Matchings with Crossings 完美匹配交叉点

International Workshop on Combinatorial Algorithms Pub Date : 2023-07-18 DOI: 10.1007/978-3-031-06678-8_4

O. Aichholzer, Ruy Fabila Monroy, P. Kindermann, I. Parada, Rosna Paul, Daniel Perz, P. Schnider, B. Vogtenhuber

引用次数: 1

Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage 叶龄参数化弦图上反馈顶点集的最小子集计算

International Workshop on Combinatorial Algorithms Pub Date : 2023-07-13 DOI: 10.1007/978-3-031-06678-8_34

Charis Papadopoulos, Spyridon Tzimas

引用次数: 1

Make a graph singly connected by edge orientations 制作一个由边方向单连通的图

International Workshop on Combinatorial Algorithms Pub Date : 2023-06-03 DOI: 10.48550/arXiv.2306.02065

Tim A. Hartmann, Komal Muluk

引用次数: 0

Maximal Distortion of Geodesic Diameters in Polygonal Domains 多边形域测地线直径的最大畸变

International Workshop on Combinatorial Algorithms Pub Date : 2023-04-07 DOI: 10.48550/arXiv.2304.03484

A. Dumitrescu, Csaba D. T'oth

引用次数: 0

Parameterized algorithms for Eccentricity Shortest Path Problem 偏心最短路径问题的参数化算法

International Workshop on Combinatorial Algorithms Pub Date : 2023-04-06 DOI: 10.48550/arXiv.2304.03233

Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma

{"title":"Parameterized algorithms for Eccentricity Shortest Path Problem","authors":"Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma","doi":"10.48550/arXiv.2304.03233","DOIUrl":"https://doi.org/10.48550/arXiv.2304.03233","url":null,"abstract":"Given an undirected graph $G=(V,E)$ and an integer $ell$, the Eccentricity Shortest Path (ESP) asks to find a shortest path $P$ such that for every vertex $vin V(G)$, there is a vertex $win P$ such that $d_G(v,w)leq ell$, where $d_G(v,w)$ represents the distance between $v$ and $w$ in $G$. Dragan and Leitert [Theor. Comput. Sci. 2017] showed that the optimization version of this problem, which asks to find the minimum $ell$ for the ESP problem, is NP-hard even on planar bipartite graphs with maximum degree 3. They also showed that ESP is W[2]-hard when parameterized by $ell$. On the positive side, Kuv cera and Such'y [IWOCA 2021] showed that the problem exhibits fixed parameter tractable (FPT) behavior when parameterized by modular width, cluster vertex deletion set, maximum leaf number, or the combined parameters disjoint paths deletion set and $ell$. It was asked as an open question in the above paper, if ESP is FPT parameterized by disjoint paths deletion set or feedback vertex set. We answer these questions partially and obtain the following results: - ESP is FPT when parameterized by disjoint paths deletion set, split vertex deletion set or the combined parameters feedback vertex set and eccentricity of the graph. - We design a $(1+epsilon)$-factor FPT approximation algorithm when parameterized by the feedback vertex set number. - ESP is W[2]-hard when parameterized by the chordal vertex deletion set.","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"517 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116196799","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}

引用次数: 0

Improved Analysis of two Algorithms for Min-Weighted Sum Bin Packing 最小加权和装箱两种算法的改进分析

International Workshop on Combinatorial Algorithms Pub Date : 2023-04-05 DOI: 10.48550/arXiv.2304.02498

G. Sagnol

引用次数: 1

Advice Complexity bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems 在线延迟f -节点、h -节点和h -边删除问题的建议复杂度界

International Workshop on Combinatorial Algorithms Pub Date : 2023-03-30 DOI: 10.48550/arXiv.2303.17346

N. Berndt, Henri Lotze

{"title":"Advice Complexity bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems","authors":"N. Berndt, Henri Lotze","doi":"10.48550/arXiv.2303.17346","DOIUrl":"https://doi.org/10.48550/arXiv.2303.17346","url":null,"abstract":"Let F be a fixed finite obstruction set of graphs and G be a graph revealed in an online fashion, node by node. The online Delayed F-Node-Deletion Problem (F-Edge-Deletion Problem}) is to keep G free of every H in F by deleting nodes (edges) until no induced subgraph isomorphic to any graph in F can be found in G. The task is to keep the number of deletions minimal. Advice complexity is a model in which an online algorithm has access to a binary tape of infinite length, on which an oracle can encode information to increase the performance of the algorithm. We are interested in the minimum number of advice bits that are necessary and sufficient to solve a deletion problem optimally. In this work, we first give essentially tight bounds on the advice complexity of the Delayed F-Node-Deletion Problem and F-Edge-Deletion Problem where F consists of a single, arbitrary graph H. We then show that the gadget used to prove these results can be utilized to give tight bounds in the case of node deletions if F consists of either only disconnected graphs or only connected graphs. Finally, we show that the number of advice bits that is necessary and sufficient to solve the general Delayed F-Node-Deletion Problem is heavily dependent on the obstruction set F. To this end, we provide sets for which this number is either constant, logarithmic or linear in the optimal number of deletions.","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126895569","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}

引用次数: 1

Capacity-Preserving Subgraphs of Directed Flow Networks 有向流网络的保容量子图

International Workshop on Combinatorial Algorithms Pub Date : 2023-03-30 DOI: 10.48550/arXiv.2303.17274

Markus Chimani, Max Ilsen

{"title":"Capacity-Preserving Subgraphs of Directed Flow Networks","authors":"Markus Chimani, Max Ilsen","doi":"10.48550/arXiv.2303.17274","DOIUrl":"https://doi.org/10.48550/arXiv.2303.17274","url":null,"abstract":"We introduce and discuss the Minimum Capacity-Preserving Subgraph (MCPS) problem: given a directed graph and a retention ratio $alpha in (0,1)$, find the smallest subgraph that, for each pair of vertices $(u,v)$, preserves at least a fraction $alpha$ of a maximum $u$-$v$-flow's value. This problem originates from the practical setting of reducing the power consumption in a computer network: it models turning off as many links as possible while retaining the ability to transmit at least $alpha$ times the traffic compared to the original network. First we prove that MCPS is NP-hard already on directed acyclic graphs (DAGs). Our reduction also shows that a closely related problem (which only considers the arguably most complicated core of the problem in the objective function) is NP-hard to approximate within a sublogarithmic factor already on DAGs. In terms of positive results, we present a simple linear time algorithm that solves MCPS optimally on directed series-parallel graphs (DSPs). Further, we introduce the family of laminar series-parallel graphs (LSPs), a generalization of DSPs that also includes cyclic and very dense graphs. Not only are we able to solve MCPS on LSPs in quadratic time, but our approach also yields straightforward quadratic time algorithms for several related problems such as Minimum Equivalent Digraph and Directed Hamiltonian Cycle on LSPs.","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123571336","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}

引用次数: 0

On Computing Large Temporal (Unilateral) Connected Components 计算大时间(单边)连接分量

International Workshop on Combinatorial Algorithms Pub Date : 2023-02-23 DOI: 10.1007/978-3-031-34347-6_24

I. L. Costa, Raul Lopes, Andrea Marino, Ana Paula Couto da Silva

引用次数: 2