An exponential time 2-approximation algorithm for bandwidth. Fürer, M., Gaspers, S., & Kasiviswanathan, S. P. Theor. Comput. Sci., 511:23--31, 2013. Paper doi bibtex @article{DBLP:journals/tcs/FurerGK13,
author = {Martin F{\"{u}}rer and
Serge Gaspers and
Shiva Prasad Kasiviswanathan},
title = {An exponential time 2-approximation algorithm for bandwidth},
journal = {Theor. Comput. Sci.},
volume = {511},
pages = {23--31},
year = {2013},
url = {http://dx.doi.org/10.1016/j.tcs.2013.03.024},
doi = {10.1016/j.tcs.2013.03.024},
timestamp = {Fri, 13 Dec 2013 00:00:00 +0100},
biburl = {http://dblp.dagstuhl.de/rec/bib/journals/tcs/FurerGK13},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
Downloads: 0
{"_id":"7pvuPHvvw6vsF3GKH","bibbaseid":"frer-gaspers-kasiviswanathan-anexponentialtime2approximationalgorithmforbandwidth-2013","downloads":0,"creationDate":"2016-10-22T00:59:55.887Z","title":"An exponential time 2-approximation algorithm for bandwidth","author_short":["Fürer, M.","Gaspers, S.","Kasiviswanathan, S. P."],"year":2013,"bibtype":"article","biburl":"http://dblp.org/pers/tb2/g/Gaspers:Serge","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Martin"],"propositions":[],"lastnames":["Fürer"],"suffixes":[]},{"firstnames":["Serge"],"propositions":[],"lastnames":["Gaspers"],"suffixes":[]},{"firstnames":["Shiva","Prasad"],"propositions":[],"lastnames":["Kasiviswanathan"],"suffixes":[]}],"title":"An exponential time 2-approximation algorithm for bandwidth","journal":"Theor. Comput. Sci.","volume":"511","pages":"23--31","year":"2013","url":"http://dx.doi.org/10.1016/j.tcs.2013.03.024","doi":"10.1016/j.tcs.2013.03.024","timestamp":"Fri, 13 Dec 2013 00:00:00 +0100","biburl":"http://dblp.dagstuhl.de/rec/bib/journals/tcs/FurerGK13","bibsource":"dblp computer science bibliography, http://dblp.org","bibtex":"@article{DBLP:journals/tcs/FurerGK13,\n author = {Martin F{\\\"{u}}rer and\n Serge Gaspers and\n Shiva Prasad Kasiviswanathan},\n title = {An exponential time 2-approximation algorithm for bandwidth},\n journal = {Theor. Comput. Sci.},\n volume = {511},\n pages = {23--31},\n year = {2013},\n url = {http://dx.doi.org/10.1016/j.tcs.2013.03.024},\n doi = {10.1016/j.tcs.2013.03.024},\n timestamp = {Fri, 13 Dec 2013 00:00:00 +0100},\n biburl = {http://dblp.dagstuhl.de/rec/bib/journals/tcs/FurerGK13},\n bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n","author_short":["Fürer, M.","Gaspers, S.","Kasiviswanathan, S. P."],"key":"DBLP:journals/tcs/FurerGK13","id":"DBLP:journals/tcs/FurerGK13","bibbaseid":"frer-gaspers-kasiviswanathan-anexponentialtime2approximationalgorithmforbandwidth-2013","role":"author","urls":{"Paper":"http://dx.doi.org/10.1016/j.tcs.2013.03.024"},"downloads":0},"search_terms":["exponential","time","approximation","algorithm","bandwidth","fürer","gaspers","kasiviswanathan"],"keywords":[],"authorIDs":[],"dataSources":["7TArQCcqBvtscygA6"]}