This preview shows page 1. Sign up to view the full content.
Unformatted text preview: round A to an integer matrix, by replacing each entry x in A with either b x c or d x e , without changing the sum of entries in any row or column of A . For example: 1.2 3.4 2.4 3.9 4.0 2.1 7.9 1.6 0.5 7- 1 4 2 4 4 2 8 1 1 Describe an efcient algorithm that either rounds A in this fashion, or reports correctly that no such rounding is possible. 3. A cycle cover of a given directed graph G = ( V , E ) is a set of vertex-disjoint cycles that cover all the vertices. Describe and analyze an efcient algorithm to nd a cycle cover for a given graph, or correctly report that none exists. [ Hint: Use ipartite atching! ] 1...
View Full Document
- Spring '08