Anand Bhalgat

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Deeparnab Chakrabarty

> Home > Persons > Anand Bhalgat

Publications

2011
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/approx/BhalgatCK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/BhalgatCK11
Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna:
Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs. APPROX-RANDOM 2011: 75-86
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/approx/BhalgatCK11a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/BhalgatCK11a
Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna:
Social Welfare in One-Sided Matching Markets without Money. APPROX-RANDOM 2011: 87-98
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1104-2964
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1104-2964
Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna:
Social Welfare in One-sided Matching Markets without Money. CoRR abs/1104.2964 (2011)
2010
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1011-3770
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1011-3770
Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna:
Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP. CoRR abs/1011.3770 (2010)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.