# Unidentified Combinatorial Problem

Given a (finite, simple, undirected) graph $\mathcal{G} = (V, E)$, an edge binning associates each $e_{ij} \in E$ with one or the other of its vertices $v_i, v_j \in V$. Let $c_i$ be the number of edges associated with vertex $v_i$ in a given edge binning. Find an edge binning such that $\max_{v_i \in V}(c_i)$ is minimized.

Is this (or its dual) a well-known problem, or reducible to a well-known problem?

Edit:

The proper formal problem statement follows (derived from Asahiro 2009), with $d^+(u)$ denoting the outdegree of vertex $u$.

Minimum Maximum Outdegree: Given a finite, simple, undirected graph $\mathcal{G}= (V, E)$, find an orientation $\Lambda$ of $\mathcal{G}$ that minimizes $\max_{u \in V}[d^+_\Lambda(u)]$.

This can equivalently be stated in terms of indegree.

Note that Asahiro et al. primarily study the problem involving a weighted graph and weighted outdegree, which is generally NP-hard.

-
V. Venkateswaran, "Minimizing Maximum Indegree," Disc. Appl. Math., vol. 143, 2004, pp. 374-378. –  Aaron Mavrinac Mar 2 '11 at 16:25
Y. Asahiro, E. Miyano, H. Ono, and K. Zenmyo, "Graph Orientation Algorithms To Minimize the Maximum Outdegree," Int. J. Found. Comput. Sci., vol. 18, 2007, pp. 197-215. –  Aaron Mavrinac Mar 2 '11 at 16:25
Y. Asahiro, J. Jansson, E. Miyano, H. Ono, and K. Zenmyo, "Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree," J. Comb. Optim., Nov. 2009, pp. 1-19. –  Aaron Mavrinac Mar 2 '11 at 16:25
K. Lee, J. Leung, and M. L. Pinedo, "A Note on Graph Balancing Problems with Restrictions," Info. Proc. Lett., vol. 110, no. 1, 2009, pp. 24-29. –  Aaron Mavrinac Mar 2 '11 at 16:26
This is also a variation of unrelated parallel machine scheduling, specifically the $P|M_j, |M_j| \leq 2|C_{\max}$ problem (see M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Second Edition, Prentice-Hall, 2002). –  Aaron Mavrinac Mar 2 '11 at 16:29

This problem is equivalent to the graph orientation problem also known as the graph balancing problem. One is given an undirected graph and has to give an orientation of the edges which minimizes the maximum out-degree. If this value is $k$, then the graph is called $k$-orientable. Here are some articles on the topic "Graph Orientation Algorithms to Minimize the Maximum Outdegree", and "A note on graph balancing problems with restrictions".

-

Let me also state an explicit criterion of the existence of orientation with out-degrees at most $d$: any induced subgraph on some, say, $k$ vertices contains at most $dk$ edges. This is clearly necessary, and the proof that it is sufficient is not hard: orient edges arbitrarily and consider the following procedure.

If out-degree of some vertex $a$ is at least $d+1$, then consider the set of vertices $x$, for which there exist oriented path from $a$. If all out-degrees of such vertices are at least $d$, then the set of them contradicts to our assumption. If deree of $x$ is less then $d$, then invert all edges on the path from $a$ to $x$.

Repeating this stuff we kill all high (more then $d$) out-degree after a fnite number of steps.

-
This is, of course, the best answer. –  Gil Kalai Feb 28 '11 at 16:46
Reminds me of Hall's Marriage Theorem. Can one prove one from the other? –  Gerry Myerson Feb 28 '11 at 22:31