Searcharxiv⌕ Search

arXiv subjects

Changki Yun

Publications and source records attributed to Changki Yun.

4 recordsLinked to original sources

A Common Improved Bound for Asymmetric TSP and Path TSP

We give polynomial-time $(R_*+\varepsilon)$-approximation algorithms for asymmetric TSP and asymmetric path TSP, for every fixed $\varepsilon>0$, where $R_*=6+\sqrt2+\sqrt{15+6\sqrt2}\approx12.2604$. Both guarantees hold relative to the corresponding subtour relaxations, whose integrality ratios are therefore at most $R_*$. This improves the previous guarantees of below $14.7$ for asymmetric TSP and $15$ for asymmetric path TSP [Vygen, 2026]. Our algorithms strengthen subtour covers and recursive augmentation in the laminar framework [Svensson, Tarnawski, Vegh, JACM'20; Traub, Vygen, 2025]. The recursive analysis retains the paths through contracted regions and accounts jointly for their cost and the dual mass they visit. We also improve the reduction from asymmetric path TSP to vertebrate pairs [Traub, Vygen, 2025] by comparing two initial walks with complementary completion bounds. Applied to Vygen's existing vertebrate-pair algorithm, this reduction alone improves the path factor from $15$ to below $14.7$, matching his asymmetric TSP guarantee.

cs.DS↗

Parallel Edge Ranking of Trees

In this work, we prove that computing the edge ranking of a tree in parallel is P-Complete, and complement this hardness with new algorithmic results for both PRAM and the MPC model. An optimal tree edge ranking assigns positive integer ranks to the edges such that any two edges with the same rank are separated by an edge of higher rank, while minimizing the highest rank. Although an optimal edge ranking, which minimizes the maximum rank, can be computed in polynomial time sequentially, its parallel complexity has remained open for almost 35 years [de la Torre, Greenlaw, Schäffer, SODA'93] and was listed as an open problem in Limits to Parallel Computation [Greenlaw, Hoover, Ruzzo, 1995]. Specifically, we show that deciding whether a tree has edge ranking at most $K$ is P-complete, already for trees of diameter at most six. Our reduction encodes monotone circuit evaluation into a greedy allocation procedure underlying known sequential algorithms. Using a rooted product of trees, we further prove that computing an edge ranking within constant additive error remains P-hard. On the algorithmic side, we break the long-standing 2-approximation barrier by designing a deterministic NC algorithm that computes an $(1+o(1))$-approximate edge ranking. Second, we show that P-completeness can be bypassed in Massively Parallel Computation (MPC) with strongly sublinear local memory: we give a deterministic algorithm that computes an optimal edge ranking of an $n$-vertex, diameter-$D$ tree in $O(\log D + \frac{n^{3/4}D^{1/4}}{S})$ rounds with $S = Θ(n^{3/4+δ})$ local memory, for $δ\in (0, 1/4)$, requiring only $O(1)$ rounds on the hard diameter-six instances. This result reinforces the separation between $\mathsf{NC}$ and what can be computed efficiently in MPC.

cs.DS↗

Optimal Learning-Augmented Algorithm for Online Bidding

Recent advances in machine learning have spurred significant interest in learning-augmented algorithms, particularly for online optimization. A growing body of work has studied online bidding in this framework, aiming to characterize the trade-off between robustness and consistency. While this trade-off is fully understood for deterministic algorithms, a gap between upper and lower bounds remains in the randomized setting. In this paper, we close this gap by presenting a Pareto-optimal randomized learning-augmented algorithm for this problem. Our approach introduces the notion of a bidding profile, a novel framework for representing the distribution over bids generated by an algorithm. We show that any bidding algorithm can be reduced, without loss of generality, to one driven by a bidding profile, and we characterize the optimal profile via a system of delayed differential equations. Finally, we demonstrate the broader applicability of our approach by extending it to the linear search problem, yielding a significant improvement over prior learning-augmented algorithms for linear search.

cs.DS↗

Parallel Small Vertex Connectivity in Near-Linear Work and Polylogarithmic Depth

We present a randomized parallel algorithm in the {\sf PRAM} model for $k$-vertex connectivity. Given an undirected simple graph, our algorithm either finds a set of fewer than $k$ vertices whose removal disconnects the graph or reports that no such set exists. The algorithm runs in $O(m \cdot \text{poly}(k, \log n))$ work and $O(\text{poly}(k, \log n))$ depth, which is nearly optimal for any $k = \text{poly}(\log n)$. Prior to our work, algorithms with near-linear work and polylogarithmic depth were known only for $k=3$ [Miller, Ramachandran, STOC'87]; for $k=4$, sequential algorithms achieving near-linear time were known [Forster, Nanongkai, Yang, Saranurak, Yingchareonthawornchai, SODA'20], but no algorithm with near-linear work could achieve even sublinear (on $n$) depth.

cs.DS↗