In the Weighted Total Acquisition problem (WTA) on a weighted graph G (only positive non-zero weights), vertex v can acquire total weight of neighbour u if and only current is at least that u. The new then zero, sum weights just before acquisition. Over all possible acquisition sequences in with function w, minimum number vertices end denoted by at(G,w). Given G, weighting an integer k?1, WTA a...