Fine-grained complexity of integer programming: The case of bounded branch-width and rank

Fomin, Fedor V.; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket

by Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

Reference:

Fine-grained complexity of integer programming: The case of bounded branch-width and rankFedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket SaurabhCoRR, volume abs/1607.05342, 2016.

Bibtex Entry:

@article{FominPRamanujanS16,
  author    = {Fedor V. Fomin and
               Fahad Panolan and
               M. S. Ramanujan and
               Saket Saurabh},
  title     = {Fine-grained complexity of integer programming: The case of bounded
               branch-width and rank},
  journal   = {CoRR},
  volume    = {abs/1607.05342},
  year      = {2016},
  url       = {http://arxiv.org/abs/1607.05342},
  timestamp = {Tue, 02 Aug 2016 12:59:27 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/FominPRS16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}