BibTeX record conf/infocom/TomassilliGHP18

download as .bib file

@inproceedings{DBLP:conf/infocom/TomassilliGHP18,
  author    = {Andrea Tomassilli and
               Fr{\'{e}}d{\'{e}}ric Giroire and
               Nicolas Huin and
               St{\'{e}}phane P{\'{e}}rennes},
  title     = {Provably Efficient Algorithms for Placement of Service Function Chains
               with Ordering Constraints},
  booktitle = {2018 {IEEE} Conference on Computer Communications, {INFOCOM} 2018,
               Honolulu, HI, USA, April 16-19, 2018},
  pages     = {774--782},
  year      = {2018},
  crossref  = {DBLP:conf/infocom/2018},
  url       = {https://doi.org/10.1109/INFOCOM.2018.8486275},
  doi       = {10.1109/INFOCOM.2018.8486275},
  timestamp = {Fri, 12 Oct 2018 14:10:40 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/infocom/TomassilliGHP18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/infocom/2018,
  title     = {2018 {IEEE} Conference on Computer Communications, {INFOCOM} 2018,
               Honolulu, HI, USA, April 16-19, 2018},
  publisher = {{IEEE}},
  year      = {2018},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8464035},
  isbn      = {978-1-5386-4128-6},
  timestamp = {Fri, 12 Oct 2018 12:47:02 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/infocom/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier