Highly Influenced

# Maximumk-covering of weighted transitive graphs with applications

@article{Sarrafzadeh1993MaximumkcoveringOW, title={Maximumk-covering of weighted transitive graphs with applications}, author={Majid Sarrafzadeh and Ruey-Der Lou}, journal={Algorithmica}, year={1993}, volume={9}, pages={84-100} }

- Published 1993 in Algorithmica
DOI:10.1007/BF01185340

Consider a weighted transitive graph, where each vertex is assigned a positive weight. Given a positive integerk, the maximumk-covering problem is to findk disjoint cliques covering a set of vertices with maximum total weight. An 0(kn 2)-time algorithm to solve the problem in a transitive graph is proposed, wheren is the number of vertices. Based on the proposed algorithm the weighted version of a number of problems in VLSI layout (e.g.,k-layer topological via minimization), computational… CONTINUE READING