On the approximability of the L(h, k)-labelling problem on bipartite graphs

Lecture Notes in Computer Science

Volumn 3499, Issue , 2005, Pages 65-77

  Calamoneri, Tiziana ^a   Vocca, Paola ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF SALENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; DECISION THEORY; EDGE DETECTION; INTEGER PROGRAMMING; KNOWLEDGE ACQUISITION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; BIPARTITE GRAPHS; EDGE-COLORING ALGORITHMS; PERFORMANCE RATIOS;

GRAPH THEORY;

EID: 24944503484     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11429647_7     Document Type: Conference Paper

References (19)

1. K. I. Aardal, S. P. M. van Hoesel, A. M. G. A. Koster, G. Mannino, and A. Sassano. Models and solutions techniques for frequency assignmet problems. Technical report, Konrad-Zuse-Zentrum für Informationtechnik Berlin, December 2001.
2. G. Agnarsson, R. Greenlaw, and M.M. Halldorson. On powers of chordal graphs and their colorings. Congr. Numerant., 144:41-65, 2000.
3. G. Agnarsson and M. M. HalldLorsson. Coloring powers of planar graphs. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 654.662, N.Y., January 9-11 2000. ACM Press.
4. N. Alon and J. H. Kim. On the degree, size, and chromatic index of a uniform hypergraph. J. Combin. Theory Ser. A, 77:165-170, 1997.
5. H. L. Bodlaender, T. Kloks, R. B. Tan, and J. van Leeuwen. λ-coloring of graphs. Proc. of STACS 2000. Lecture Notes in Computer Science, 1770:395-406, 2000.
6. T. Calamoneri. Exact solution of a class of frequency assignment problems in cellular networks (extended abstract). Proc. of the ICTCS 2003. Lecture Notes in Computer Science, 2841:163-173, 2003.
7. T. Calamoneri. The l(h, k)-labelling problem: A survey. Technical Report 04/2004, Dept. of Computer Science, University of Rome La Sapienza, 2004.
8. T. Calamoneri, A. Pelc, and R. Petreschi. Labelling trees with a condition at distance two. In Proc. of R.C. Bose Centenary Symp. on Discr. Math. and Applications, 2002. Accepted to Discrete Mathematics.
9. R. Diestel. Graph theory. Springer-Verlag, New York, 1997. Translated from the 1996 German original.
10. j-numbers of the products of complete graphs. Congr. Numer., 140:141-160, 1999.
11. J. P. Georges, D. W. Mauro, and M. I. Stein. Labeling products of complete graphs with a condition at distance two. SIAM Journal on Discrete Mathematics, 14(l):28-35, February 2001.
12. J. R. Griggs and R. K. Yeh. Labelling graphs with a condition at distance 2. SIAM Journal on Discrete Mathematics, 5(4):586-595, November 1992.
13. Y. L. Lin and S. S. Skiena. Algorithms for square roots of graphs. SIAM Journal on Discrete Mathematics, 8(1):99-118, February 1995.
14. S. T. McCormick. Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem. Mathematical Programming, 26(2):153-171, 1983.
15. R. A. Murphey, P. M. Pardalos, and M. G. C. Resende. Frequency assignment problems. In D.-Z. Du and P. M. Pardalos, editors, Handbook of combinatorial optimization, volume Supplement A. Kluwer Academic Publishers, 1999.
16. N. Pippinger and J. Spencer. Asymptotic behaviour of the chromatic index for hypergraphs. J. Combin. Theory Ser. A, 51:24-42, 1989.
17. C. E. Shannon. A theorem on coloring the lines of a network. J. Math. Phys, 28:148-151, 1949.
18. J. van den Heuvel, R. A. Leese, and M. A. Shepherd. Graph labeling and radio channel assignment. Journal of Graph Theory, 29, 1998.
19. V. G. Vizing. On an estimate of the chromatic class of a p-graph (in russian). Diskret. Analiz, 3:23-30, 1964.