6 citations · 14 across the 22 of their papers we have counts for
Showing 2019 · cs.DSShow all
2 papers · 2 filters
cs.DS2019
Graph Pricing with Limited Supply
Zachary Friggstad, Maryam Mahboub
We study approximation algorithms for graph pricing with vertex capacities yet without the traditional envy-free constraint. Specifically, we have a set of items and a set of c…
cs.DS2019
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time
Zachary Friggstad, Chaitanya Swamy
We give the first constant-factor approximation for the Directed Latency problem in quasi-polynomial time. Here, the goal is to visit all nodes in an asymmetric metric with a singl…