{"identifier":"nobleid:/w1/20260521/97DF2EDB","arkIdentifier":"ark:/48914/w1/20260521/97DF2EDB","version":1,"workTitle":"Heuristic algorithms for the Maximum Colorful Subtree problem","workType":"Journal Article","authors":"Fertin, Guillaume, Fradin, Julien, W. Timothy J. White","description":null,"workUrl":null,"existingDoi":"10.4230/lipics.cpm.2018.17","createdAt":"2026-05-21T12:59:55.375659Z","canonicalUrl":"https://nobleid.org/ark:/48914/w1/20260521/97DF2EDB.v1"}