Parameterized Complexity of Weighted Multicut in Trees

Galby, Esther; Marx, Dániel; Schepper, Philipp; Sharma, Roohani; Tale, Prafullkumar

doi:10.1007/978-3-031-15914-5_19

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Parameterized Complexity of Weighted Multicut in Trees

MPS-Authors

/persons/resource/persons255161

Sharma, Roohani
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Galby, E., Marx, D., Schepper, P., Sharma, R., & Tale, P. (2022). Parameterized Complexity of Weighted Multicut in Trees. In M. A. Bekos, & M. Kaufmann (Eds.), Graph-Theoretic Concepts in Computer Science (pp. 257-270). Berlin: Springer. doi:10.1007/978-3-031-15914-5_19.

Cite as: https://hdl.handle.net/21.11116/0000-000B-5925-8

Abstract

There is no abstract available