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}
}
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

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

To appear in Discrete Applied Mathematics, 1992

  • International Workshop on Discrete Algorithms, Complexity, Fukuoka, Japan, November
  • Lou, R. D., Sarrafzadeh, M., and Lee, D. T., An…
  • 1989

Layout Design and Verification

  • T. Ohtsuki
  • IEEE Transaction on Computers,
  • 1986

A Linear Time Algorithm for the Two Track Assignment Problem

  • W. L. Hsu, K. H. Tsai
  • Circular-Arc Graphs, Networks,
  • 1982

Similar Papers

Loading similar papers…