10 citations · 19 across the 5 of their papers we have counts for
7 papers
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
Parinya Chalermsook, Matthias Kaul, Matthias Mnich +3
The fundamental sparsest cut problem takes as input a graph together with the edge costs and demands, and seeks a cut that minimizes the ratio between the costs and demands acr…
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit +1
We study the variant of the Euclidean Traveling Salesman problem where instead of a set of points, we are given a set of lines as input, and the goal is to find the shortest tour t…
Vertex Sparsification for Edge Connectivity
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit +5
Graph compression or sparsification is a basic information-theoretic and computational question. A major open problem in this research area is whether -approximate cut-prese…
Mimicking Networks Parameterized by Connectivity
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit +1
Given a graph , capacities on edges, and a subset of terminals , a mimicking network for is a graph $(…
On Approximating Degree-Bounded Network Design Problems
Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit +3
Directed Steiner Tree (DST) is a central problem in combinatorial optimization and theoretical computer science: Given a directed graph with edge costs $c \in \mathbb{R}…
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs
Parinya Chalermsook, Syamantak Das, Guy Even +2
In the Group Steiner Tree problem (GST), we are given a (vertex or edge)-weighted graph on vertices, a root vertex and a collection of groups $\{S_i\}_{i\in[h]}:…