default search action
BibTeX record conf/fsttcs/KonemannR03
@inproceedings{DBLP:conf/fsttcs/KonemannR03, author = {Jochen K{\"{o}}nemann and R. Ravi}, editor = {Paritosh K. Pandya and Jaikumar Radhakrishnan}, title = {Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees}, booktitle = {{FST} {TCS} 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2914}, pages = {289--301}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-24597-1\_25}, doi = {10.1007/978-3-540-24597-1\_25}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/KonemannR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.