2 citations · 5 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022★ 2 cited
Pandora's Problem with Nonobligatory Inspection: Optimal Structure and a PTAS
Hedyeh Beyhaghi, Linda Cai
Weitzman introduced Pandora's box problem as a mathematical model of sequential search with inspection costs, in which a searcher is allowed to select a prize from one of alter…
cs.DS2018
Separators for Planar Graphs that are Almost Trees
Linda Cai, Sariel Har-Peled, Simiao Ye
We prove that a connected planar graph with vertices and edges has a vertex separator of size , and this separator can be computed in linear time.