Weighted total acquisition

In the Weighted Total Acquisition problem (WTA) on a weighted graph G (only positive non-zero weights), a vertex v can acquire the total weight of a neighbour u if and only if the current weight of v is at least that of u. The new weight of u is then zero, and the new weight of v is then the sum of...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 304; pp. 260 - 282
Main Authors:	Bagan, Guillaume, Gledel, Valentin, Heinrich, Marc, Mc Inerney, Fionn
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 15.12.2021 Elsevier BV Elsevier
Subjects:	Algorithms Apexes Complexity Computer Science Discrete Mathematics Dynamic programming Graphs Parameterization Polynomials Sequences Total acquisition Trees (mathematics) Treewidth Weighting functions Total acquisition Dynamic programming Complexity Treewidth
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!