◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

C. Chekuri

8 papers hereh-index 5511.7k citations198 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author8

Across the 8 of 8 papers where every author was matched, so the position is known.

fields
  • cs.DS7
  • cs.CG1

identity via Semantic Scholar / OpenAlex

activity
20072009
most citedDependent Randomized Rounding for Matroid Polytopes and Applications

38 citations · 84 across the 8 of their papers we have counts for

collaborators
Showing 2008Show all

2 papers · 1 filter

cs.DS2008

Online Scheduling to Minimize the Maximum Delay Factor

Chandra Chekuri, Benjamin Moseley

In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcasti…

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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.