15 citations · 20 across the 3 of their papers we have counts for
3 papers
cs.DS2008★ 3 cited
Algorithms for Secretary Problems on Graphs and Hypergraphs
Nitish Korula, Martin Pal
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We…
cs.DS2008★ 2 cited
Min-Cost 2-Connected Subgraphs With k Terminals
Chandra Chekuri, Nitish Korula
In the k-2VC problem, we are given an undirected graph G with edge costs and an integer k; the goal is to find a minimum-cost 2-vertex-connected subgraph of G containing at least k…
cs.DS2007★ 15 cited
Approximation Algorithms for Orienteering with Time Windows
Chandra Chekuri, Nitish Korula
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s,t and a time limit T, find an s-t walk of total length at mos…