Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Conference Paper
%1 conf/iwpec/ShangGCT17
%A Shang, Lei
%A Garraffa, Michele
%A Croce, Federico Della
%A T'kindt, Vincent
%B IPEC
%D 2017
%E Lokshtanov, Daniel
%E Nishimura, Naomi
%I Schloss Dagstuhl - Leibniz-Zentrum für Informatik
%K dblp
%P 28:1-28:12
%T Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem.
%U http://dblp.uni-trier.de/db/conf/iwpec/ipec2017.html#ShangGCT17
%V 89
%@ 978-3-95977-051-4
@inproceedings{conf/iwpec/ShangGCT17,
added-at = {2021-04-16T00:00:00.000+0200},
author = {Shang, Lei and Garraffa, Michele and Croce, Federico Della and T'kindt, Vincent},
biburl = {https://www.bibsonomy.org/bibtex/28183cc2026c44cf3f9e6353dbe3bce0d/dblp},
booktitle = {IPEC},
crossref = {conf/iwpec/2017},
editor = {Lokshtanov, Daniel and Nishimura, Naomi},
ee = {https://doi.org/10.4230/LIPIcs.IPEC.2017.28},
interhash = {71cf7dff0c684a02a4bdf6e411d3f377},
intrahash = {8183cc2026c44cf3f9e6353dbe3bce0d},
isbn = {978-3-95977-051-4},
keywords = {dblp},
pages = {28:1-28:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
series = {LIPIcs},
timestamp = {2024-04-10T15:35:02.000+0200},
title = {Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem.},
url = {http://dblp.uni-trier.de/db/conf/iwpec/ipec2017.html#ShangGCT17},
volume = 89,
year = 2017
}