Upper degree-constrained partial orientations

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 554-563

  Gabow, Harold N ^a  

^a University of Colorado at Boulder   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; EDGE DETECTION; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

3-DIMENSIONAL MATCHING; PARTIAL ORIENTATIONS; POLYNOMIAL TIMES; UNDIRECTED GRAPHS;

CONSTRAINT THEORY;

EID: 33244474841     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109618     Document Type: Conference Paper

References (7)

1. J. Bang-Jensen and G. Gutin, Digraphs: Theory, Algorithms and Applications, Springer, NY, 2001.
2. A. Frank and A. Gyárfás, How to orient the edges of a graph?, in Combinatorics Volume I (Proc. Fifth Hungarian Colloq. on Combinatorics, Keszthely, 1976, A. Hajnal, V.T. Sós, eds.), North-Holland, Amsterdam (1978), pp.353-364.
3. S.L. Hakimi, On the degrees of the vertices of a directed graph, J. Franklin Institute, 279 (1965), pp. 290-308.
4. C.A.J. Hurkens and A. Schrijver, On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Disc. Math., 2 (1989), pp. 68-72.
5. K. Jain, A factor 2 approximation algorithm for the generalized Steiner network problem, Combinatorica, 21 (2001), pp. 39-60.
6. N. Kakimura and S. Iwata, Computing the inertia from sign patterns, Eleventh MPS Conf. on Integer Programming and Combinatorial Optimization, 2005, M. Jünger and V. Kaibel eds., Springer-Verlag LNCS 3509, pp.236-248.
7. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, Springer, NY, 2003.