Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Chaitanya Swamy

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 André Linhares

> Home > Persons > Chaitanya Swamy

Publications

2020
[j22]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/LinharesOSZ20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/LinharesOSZ20
André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen:
Approximate multi-matroid intersection via iterative refinement. Math. Program. 183(1): 397-418 (2020)
2019
[c52]
- view
  authority control:
- export record
  dblp key:
  - conf/ipco/LinharesOSZ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipco/LinharesOSZ19
André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen:
Approximate Multi-matroid Intersection via Iterative Refinement. IPCO 2019: 299-312
[c50]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/LinharesS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/LinharesS19
André Linhares, Chaitanya Swamy:
Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions. STOC 2019: 768-779
[i33]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1904-07381
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1904-07381
André Linhares, Chaitanya Swamy:
Approximation Algorithms for Distributionally Robust Stochastic Optimization with Black-Box Distributions. CoRR abs/1904.07381 (2019)
2018
[j18]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/LinharesS18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/LinharesS18
André Linhares, Chaitanya Swamy:
Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems. Math. Program. 172(1-2): 17-34 (2018)
[i28]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1811-09027
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1811-09027
André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen:
Approximate Multi-Matroid Intersection via Iterative Refinement. CoRR abs/1811.09027 (2018)
2017
[c44]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/icalp/LinharesS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/LinharesS17
André Linhares, Chaitanya Swamy:
Improved Algorithms for MST and Metric-TSP Interdiction. ICALP 2017: 32:1-32:14
[i27]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/LinharesS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/LinharesS17
André Linhares, Chaitanya Swamy:
Improved Algorithms for MST and Metric-TSP Interdiction. CoRR abs/1706.00034 (2017)
2016
[c40]
- view
  authority control:
- export record
  dblp key:
  - conf/ipco/LinharesS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipco/LinharesS16
André Linhares, Chaitanya Swamy:
Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems. IPCO 2016: 38-49
[i22]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/LinharesS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/LinharesS16
André Linhares, Chaitanya Swamy:
Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems. CoRR abs/1605.03203 (2016)

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.