Searcharxiv⌕ Search

arXiv subjects

Richard Z Huang

Publications and source records attributed to Richard Z Huang.

5 recordsLinked to original sources

A Little Length Slack Goes a Long Way in Planar Length-Constrained Network Design

Problems in length-constrained network design ask for min-cost subgraphs connecting $k$ input vertex pairs by paths of length at most $h$. Algorithms that instead connect these pairs by paths of length at most $βh$ are said to have length slack $β$. Recent work has shown that poly-time polylogarithmic approximations with polylogarithmic length slack are possible for a broad class of both directed and multicommodity length-constrained network design problems on planar graphs. We give the first poly-time polylogarithmic approximations with $O(1)$ length slack for these problems on planar graphs. In particular, for the length-constrained setting, we give LP-competitive algorithms for planar graphs with length slack $1+ε$ and approximation ratios of $O(\log^2 k/ε)$ for directed Steiner tree and $O(\log^5 k/ε^2)$ for (undirected) Steiner forest. Similarly, for length-constrained directed Steiner forest, we give an $O(\log^6 k/ε)$ approximation on planar graphs with length slack $6+ε$. Our approach is based on a novel charging argument that charges the cost of our solution to the length of the LP and the length of our solution to the cost of the LP. We complement these algorithms with hardness results that separate planar and general graphs for both forest problems: under standard complexity assumptions, we rule out polylogarithmic approximations on general graphs with length slack below $3$.

cs.DS↗

Flows in High Degree Places: Sublinear Spanning Tree Congestion

The congestion of a spanning tree $T$ of graph $G$ is the maximum congestion of an edge of $T$ if each edge of $G$ is routed on $T$. Prior work showed that obtaining a minimum congestion spanning tree is NP-hard to approximate within $6/5$, yet the only known approximation algorithm is a trivial $n/2$-approximation from returning any spanning tree of the graph. We give a simple poly-time $\tilde{O}(n^{6/7})$-approximation for minimum congestion spanning tree on $n$-vertex graphs. We obtain this result via a $\tilde{O}(m^{2/3})$-approximation, where $m$ is the number of edges. Our algorithm is based on a new \textit{flow-or-degree decomposition} which deletes a small number of edges so that each remaining component either has low degree or admits a low congestion flow. We also show that, assuming the Small Set Expansion Hypothesis, it is NP-hard to $O(1)$-approximate this problem, even on graphs of constant maximum degree.

cs.DS↗

Planar Length-Constrained Minimum Spanning Trees

In length-constrained minimum spanning tree (MST) we are given an $n$-node graph $G = (V,E)$ with edge weights $w : E \to \mathbb{Z}_{\geq 0}$ and edge lengths $l: E \to \mathbb{Z}_{\geq 0}$ along with a root node $r \in V$ and a length-constraint $h \in \mathbb{Z}_{\geq 0}$. Our goal is to output a spanning tree of minimum weight according to $w$ in which every node is at distance at most $h$ from $r$ according to $l$. We give a polynomial-time algorithm for planar graphs which, for any constant $ε> 0$, outputs an $O\left(\log^{1+ε} n\right)$-approximate solution with every node at distance at most $(1+ε)h$ from $r$ for any constant $ε> 0$. Our algorithm is based on new length-constrained versions of classic planar separators which may be of independent interest. Additionally, our algorithm works for length-constrained Steiner tree and bounds the integrality gap of the natural linear program as $O(\log^3 n /ε)$, again with $(1+ε)$ slack in the length constraint. Complementing this, we show that any algorithm on general graphs for length-constrained MST in which nodes are at most $2h$ from $r$ cannot achieve an approximation of $O\left(\log ^{2-ε} n\right)$ for any constant $ε> 0$ under standard complexity assumptions; as such, our results separate the approximability of length-constrained MST in planar and general graphs.

cs.DS↗

Improved Parallel Algorithms for EF1 Allocations

Allocating $m$ indivisible goods among $n$ agents is a fundamental task in fair division. Recent work of Garg and Psomas [AAMAS 2025] initiated the study of parallel algorithms for envy-free up to one good (EF1) allocations, giving NC algorithms for $2$ and $3$ agents. They also showed CC-hardness results for simulating the classic Round Robin algorithm for EF1 allocations, even when each agent values at most $3$ goods and each good is valued by at most $3$ agents. We strengthen these results. For the case of $2$ agents, we quadratically improve the depth from $O(\log ^ 2 m) $ to $O(\log m)$ and the work from $O(m \log m)$ to $O(m)$. Furthermore, we significantly generalize beyond $3$ agents by giving NC algorithms for any constant number of agents. We also give randomized algorithms with depth $\tilde{O}(m/n)$ and polynomial work. As corollaries of these results, we obtain NC algorithms whenever each agent values at most $polylog(m)$ goods and each good is valued by at most $O(1)$ agents, and RNC algorithms when each agent values at most $polylog(m)$ goods. As such, our algorithms bypass the CC-hardness of Garg and Psomas by not simulating Round Robin. We also complement the aforementioned CC-hardness by showing the CC-completeness of simulating Round Robin. Lastly, beyond EF1 allocations, we show that computing envy-free up to $k$ goods allocations is possible for $k \approx \sqrt{m}$ in RNC, or $k = m^{\varepsilon}$ in sublinear depth for any constant $\varepsilon > 0$.

cs.DS↗

Simple Length-Constrained Minimum Spanning Trees

In the length-constrained minimum spanning tree (MST) problem, we are given an $n$-node edge-weighted graph $G$ and a length constraint $h \geq 1$. Our goal is to find a spanning tree of $G$ whose diameter is at most $h$ with minimum weight. Prior work of Marathe et al.\ gave a poly-time algorithm which repeatedly computes maximum cardinality matchings of minimum weight to output a spanning tree whose weight is $O(\log n)$-approximate with diameter $O(\log n)\cdot h$. In this work, we show that a simple random sampling approach recovers the results of Marathe et al. -- no computation of min-weight max-matchings needed! Furthermore, the simplicity of our approach allows us to tradeoff between the approximation factor and the loss in diameter: we show that for any $ε\geq 1/\operatorname{poly}(n)$, one can output a spanning tree whose weight is $O(n^ε/ ε)$-approximate with diameter $O(1/ε)\cdot h$ with high probability in poly-time. This immediately gives the first poly-time $\operatorname{poly}(\log n)$-approximation for length-constrained MST whose loss in diameter is $o(\log n)$.

cs.DS↗