Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem (bibtex)
by Disser, Y., Griesbach, S., Klimm, M. and Lutz, A.
Reference:
Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem (Disser, Y., Griesbach, S., Klimm, M. and Lutz, A.), In Proceedings of the 32nd Annual European Symposium on Algorithms (ESA), 2024.
Bibtex Entry:
@inproceedings{DisserGriesbachKlimmLutz-24,
 title = {Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem},
 author = {Disser, Y. and Griesbach, S. and Klimm, M. and Lutz, A.},
 booktitle = {Proceedings of the 32nd Annual European Symposium on Algorithms (ESA)},
 pages = {47(16)},
 year = {2024},
}
Powered by bibtexbrowser