Approximating the maximally balanced connected partition problem in graphs

Information Processing Letters

Volumn 60, Issue 5, 1996, Pages 225-230

  Chlebíková, Janka ^a  

^a Physics and Informatics   (Slovakia)

Author keywords

Analysis of algorithms; Combinatorial problems; Connected graphs

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; FUNCTIONS; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

COMBINATORIAL PROBLEMS; CONNECTED GRAPHS; MAXIMALLY BALANCED SPANNING TREE PROBLEM; OBJECTIVE FUNCTION;

ALGORITHMS;

EID: 0030577307     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(96)00175-5     Document Type: Article

References (3)

1. G. Galbiati, A. Morzenti and F. Maffioli, On the approximability of some maximum spanning tree problems, in: Proc. 2nd Internat. Symp. Latin American Theoretical Informatics, Lecture Notes in Computer Science 911 (Springer, Berlin, 1995) 300-311.
2. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to The Theory of NP-Completeness (Freeman, New York, 1979).
3. C.H. Papadimitriou and M. Yannakakis, The complexity of restricted spanning tree problems, J. ACM 29 (2) (1982) 285-309.