15 citations · 19 across the 7 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture
Venkatesan Guruswami, Sai Sandeep
A famous conjecture of Tuza states that the minimum number of edges needed to cover all the triangles in a graph is at most twice the maximum number of edge-disjoint triangles. Thi…
cs.DS2020
Minmax Regret for sink location on paths with general capacities
Mordecai Golin, Sai Sandeep
In dynamic flow networks, every vertex starts with items (flow) that need to be shipped to designated sinks. All edges have two associated quantities: length, the amount of time re…