15 citations · 22 across the 9 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2018
Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network
Amy Babay, Michael Dinitz, Zeyu Zhang
We consider the Shallow-Light Steiner Network problem from a fixed-parameter perspective. Given a graph , a distance bound , and pairs of vertices $(s_1,t_1),\cdots,(s_p,…
cs.DS2016
Approximating Approximate Distance Oracles
Michael Dinitz, Zeyu Zhang
Given a finite metric space , an approximate distance oracle is a data structure which, when queried on two points , returns an approximation to the the actual di…
cs.DS2013
Ranking with Diverse Intents and Correlated Contents
Jian Li, Zeyu Zhang
We consider the following document ranking problem: We have a collection of documents, each containing some topics (e.g. sports, politics, economics). We also have a set of users w…