Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/networks/AverbakhB03
%A Averbakh, Igor
%A Berman, Oded
%D 2003
%J Networks
%K dblp
%N 2
%P 97-103
%T An improved algorithm for the minmax regret median problem on a tree.
%U http://dblp.uni-trier.de/db/journals/networks/networks41.html#AverbakhB03
%V 41
@article{journals/networks/AverbakhB03,
added-at = {2003-05-27T00:00:00.000+0200},
author = {Averbakh, Igor and Berman, Oded},
biburl = {https://www.bibsonomy.org/bibtex/225150091de85d95de04b97e600350ee4/dblp},
date = {2003-05-27},
description = {dblp},
ee = {http://dx.doi.org/10.1002/net.10062},
interhash = {2591544c988fc0f5243e0c8caf69528b},
intrahash = {25150091de85d95de04b97e600350ee4},
journal = {Networks},
keywords = {dblp},
number = 2,
pages = {97-103},
timestamp = {2003-05-27T00:00:00.000+0200},
title = {An improved algorithm for the minmax regret median problem on a tree.},
url = {http://dblp.uni-trier.de/db/journals/networks/networks41.html#AverbakhB03},
volume = 41,
year = 2003
}
