Multigraph realizations of degree sequences: Maximization is easy, minimization is hard

Operations Research Letters

Volumn 36, Issue 5, 2008, Pages 594-596

  Hulett, Heather ^a   Will, Todd G ^a   Woeginger, Gerhard J ^b  

^a UNIVERSITY OF WISCONSIN LA CROSSE   (United States)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Combinatorial optimization; Computational complexity; Graph theory

Indexed keywords

NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; DEGREE SEQUENCES; GRAPH THEORY; LOOPLESS; MAXIMIZATION PROBLEMS; MINIMIZATION PROBLEMS; NP-HARD; POLYNOMIAL-TIME;

OPTIMIZATION;

EID: 50249145668     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2008.05.004     Document Type: Article

References (10)

1. Barvinok A., Fekete S.P., Johnson D.S., Tamir A., Woeginger G.J., and Woodroofe R. The geometric maximum traveling salesman problem. Journal of the ACM 50 (2003) 641-664
2. Colbourn C.J. The complexity of completing partial latin squares. Discrete Applied Mathematics 8 (1984) 25-30
3. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco
4. Habib M., Möhring R.H., and Steiner G. Computing the bump number is easy. Order 5 (1988) 107-129
5. Hakimi S. On realizability of a set of integers as degrees of the vertices of a linear graph. SIAM Journal on Applied Mathematics 10 (1962) 496-506
6. Kleitman D.J. Minimal number of multiple edges in realization of an incidence sequence without loops. SIAM Journal on Applied Mathematics 18 (1970) 25-28
7. Li W.N. The complexity of segmented channel routing. IEEE Trans. Computer-Aided Design 14 (1995) 518-523
8. Owens B., and Trent H.M. On determining minimal singularities for the realization of an incidence sequence. SIAM Journal on Applied Mathematics 15 (1967) 406-418
9. Will T.G., and Hulett H. Parsimonious multigraphs. SIAM Journal on Discrete Mathematics 18 (2004) 241-245
10. Yu W., Hoogeveen H., and Lenstra J.K. Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard. Journal of Scheduling 7 (2004) 333-348