### Abstract

A degree-constrained graph orientation of an undirected graph G is an assignment of a direction to each edge in G such that the outdegree of every vertex in the resulting directed graph satisfies a specified lower and/or upper bound. Such graph orientations have been studied for a long time and various characterizations of their existence are known. In this paper, we consider four related optimization problems introduced in [4]: For any fixed non-negative integer W, the problems Max W -Light, Min W -Light, Max W -Heavy, and Min W -Heavy take as input an undirected graph G and ask for an orientation of G that maximizes or minimizes the number of vertices with outdegree at most W or at least W. The problems' computational complexities vary with W. Here, we resolve several open questions related to their polynomial-time approximability and present a number of positive and negative results.

Original language | English |
---|---|

Title of host publication | Approximation and Online Algorithms - 11th International Workshop, WAOA 2013, Revised Selected Papers |

Publisher | Springer Verlag |

Pages | 24-36 |

Number of pages | 13 |

ISBN (Print) | 9783319080000 |

DOIs | |

Publication status | Published - Jan 1 2014 |

Event | 11th International Workshop on Approximation and Online Algorithms, WAOA 2013 - Sophia Antipolis, France Duration: Sep 5 2013 → Sep 6 2013 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 8447 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 11th International Workshop on Approximation and Online Algorithms, WAOA 2013 |
---|---|

Country | France |

City | Sophia Antipolis |

Period | 9/5/13 → 9/6/13 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Degree-constrained graph orientation: Maximum satisfaction and minimum violation'. Together they form a unique fingerprint.

## Cite this

*Approximation and Online Algorithms - 11th International Workshop, WAOA 2013, Revised Selected Papers*(pp. 24-36). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8447 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-08001-7_3