A min-max theorem on feedback vertex sets

Mathematics of Operations Research

Volumn 27, Issue 2, 2002, Pages 361-371

  Cai, Mao Cheng ^a   Deng, Xiaotie ^b   Zang, Wenan ^c  

^a INSTITUTE OF SYSTEMS SCIENCE   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Approximation algorithm; Bipartite tournament; Feedback vertex set; Min max relation; Totally dual integrality

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; VECTORS;

FEEDBACK VERTEX SETS; MIN-MAX THEOREM;

LINEAR SYSTEMS;

EID: 0036577366     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.27.2.361.328     Document Type: Article

References (10)

1. A TDI system and its application to approximation algorithms
2. An approximation algorithm for feedback vertex sets in tournaments
3. A min-max relation for submodular functions on graphs
4. Total dual integrality of linear systems
5. Total dual integrality and integral polyhedra
6. The primal-dual method for approximation algorithms and its application to network design problems
7. Total dual integrality from directed graphs, crossing families and sub- and supermodular functions
8. On total dual integrality
9. Polyhedral combinatorics
10. On feedback problems in digraphs