×

Found 2 Documents (Results 1–2)

Heuristic algorithms for the maximum colorful subtree problem. (English) Zbl 1494.92050

Parida, Laxmi (ed.) et al., 18th international workshop on algorithms in bioinformatics, WABI 2018, Helsinki, Finland, August 20–22, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 113, Article 23, 14 p. (2018).
MSC:  92C40 92-08 90C59
PDFBibTeX XMLCite
Full Text: DOI arXiv

Algorithmic aspects of the maximum colorful arborescence problem. (English) Zbl 1485.68181

Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 14th annual conference, TAMC 2017, Bern, Switzerland, April 20–22, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10185, 216-230 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Year of Publication

all top 3

Main Field