Theory of linear and integer programming
Theory of linear and integer programming
Combinatorial optimization: packing and covering
Combinatorial optimization: packing and covering
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Approximation Algorithm for Feedback Vertex Sets in Tournaments
SIAM Journal on Computing
An Approximation Algorithm for Feedback Vertex Sets in Tournaments
SIAM Journal on Computing
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
Approximation algorithms and hardness results for cycle packing problems
ACM Transactions on Algorithms (TALG)
Combinatorial Optimization: Theory and Algorithms
Combinatorial Optimization: Theory and Algorithms
Disjoint cycles: integrality gap, hardness, and approximation
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
Let G=(V,E) be an undirected graph in which every vertex v驴V is assigned a nonnegative integer w(v). A w-packing is a collection of cycles (repetition allowed) in G such that every v驴V is contained at most w(v) times by the members of . Let 驴w驴=2|V|+驴 v驴V 驴log驴(w(v)+1)驴 denote the binary encoding length (input size) of the vector (w(v): v驴V) T . We present an efficient algorithm which finds in O(|V|8驴w驴2+|V|14) time a w-packing of maximum cardinality in G provided packing and covering cycles in G satisfy the 驴+-max-flow min-cut property.