All-norms and all-l\_p-norms approximation algorithms
D. Golovin, A. Gupta, A. Kumar, and K. Tangwongsan. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, (2008)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 golovin2008all
%A Golovin, Daniel
%A Gupta, Anupam
%A Kumar, Amit
%A Tangwongsan, Kanat
%B IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
%D 2008
%K 2023 Seminar Sommersemester Wissensverarbeitung kde
%T All-norms and all-l\_p-norms approximation algorithms
@inproceedings{golovin2008all,
added-at = {2023-06-21T13:02:17.000+0200},
author = {Golovin, Daniel and Gupta, Anupam and Kumar, Amit and Tangwongsan, Kanat},
biburl = {https://www.bibsonomy.org/bibtex/2d0a02e963bfb277bc91eceab5d563138/ypse},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
interhash = {40d0423f36ca3599e5d3a65f7744901a},
intrahash = {d0a02e963bfb277bc91eceab5d563138},
keywords = {2023 Seminar Sommersemester Wissensverarbeitung kde},
organization = {Schloss Dagstuhl-Leibniz-Zentrum f{\"u}r Informatik},
timestamp = {2023-07-03T17:04:00.000+0200},
title = {All-norms and all-l\_p-norms approximation algorithms},
year = 2008
}
