The graph genus problem is NP-complete
Journal of Algorithms
Edge separators of planar and outerplanar graphs with applications
Journal of Algorithms
Fast Approximate Graph Partitioning Algorithms
SIAM Journal on Computing
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On Quadratic Lattice Approximations
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Edge Separators for Graphs of Bounded Genus with Applications
WG '91 Proceedings of the 17th International Workshop
Open block scheduling in optical communication networks
Theoretical Computer Science - Approximation and online algorithms
Hi-index | 0.00 |
Given a graph G=(V,E) with n vertices, m edges and maximum vertex degree Δ, the load distribution of a coloring . $\varphi: V \longrightarrow$ red, blue is a pair dϕ=(rϕ, bϕ), where rϕ is the number of edges with at least one end-vertex colored red and bϕ is the number of edges with at least one end-vertex colored blue. Our aim is to find a coloring ϕ such that the (maximum) load, lϕ := max{rϕ, bϕ}, is minimized. The problem has applications in broadcast WDM communication networks (Ageev et al., 2004). After proving that the general problem is NP-hard we give a polynomial time algorithm for optimal colorings of trees and show that the optimal load is at most m/2+${\it \Delta}$log2n. For graphs with genus g0, we show that a coloring with load OPT(1 + o(1)) can be computed in O(n+g)-time, if the maximum degree satisfies ${\it \Delta} = o(\frac{m^{2}}{ng})$ and an embedding is given. In the general situation we show that a coloring with load at most ${\frac{3} {4}}m+O({\sqrt{{\it \Delta}m}})$ can be found in deterministic polynomial time using a derandomized version of Azuma’s martingale inequality. This bound describes the “typical” situation: in the random multi-graph model we prove that for almost all graphs, the optimal load is at least $\frac{3}{4}m - {\sqrt{3mn}}$ . Finally, we generalize our results to k–colorings for k 2.