Yiran Zhang

most citedAdaptivity Gaps for Stochastic Probing with Subadditive Functions

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

cs.DS2025

A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs

Kuowen Chen, Nicole Wein, Yiran Zhang

Given a graph and a pair of terminals $s$ , $t$ , the next-to-shortest path problem asks for an $s \to t$ (simple) path that is shortest among all not shortest $s \to t$ paths…

cs.DS2025

New Results on a General Class of Minimum Norm Optimization Problems

Kuowen Chen, Jian Li, Yuval Rabani +1

We study the general norm optimization for combinatorial problems, initiated by Chakrabarty and Swamy (STOC 2019). We propose a general formulation that captures a large class of c…

cs.DS2025★ 1 cited

Adaptivity Gaps for Stochastic Probing with Subadditive Functions

Jian Li, Yinchen Liu, Yiran Zhang

In this paper, we study the stochastic probing problem under a general monotone norm objective. Given a ground set $U = [n]$ , each element $i \in U$ has an independent nonnegative…

math.CO2019

New Nonexistence Results on Circulant Weighing Matrices

K. T. Arasu, Daniel M. Gordon, Yiran Zhang

A circulant weighing matrix $W = (w_{i, j})$ is a square matrix of order $n$ and entries $w_{i, j}$ in ${0, \pm 1}$ such that $W W^{T} = k I_{n}$ . In his thesis, Strassler gave a table of…