Graph orientaion to maximize the minmum weighted outdegre

Yuichi Asahiro, Jesper Jansso, Eiji Miyano, Hirotaka Ono

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We study a new variant of the graph orientation problem called MAXMINO where the input is an undirected, edge-weighted graph and the objective is to assign a direction to each edge so that the minimum weighted outdegree (taken over all vertices in the resulting directed graph) is maximized. All edge weights are assumed to be positive integers. This problem is closely related to the job scheduling on parallel machines, called the machine covering problem, where its goal is to assign jobs to parallel machines such that each machine is covered as much as possible. First, we prove that MAXMINO is strongly NP-hard and cannot be approximated within a ratio of 2 - ε for any constant ε > 0 in polynomial time unless P-NP, even if all edge weights belong to {1,2}, every vertex has degree at most three, and the input graph is bipartite or planar. Next, we show how to solve MAXMINO exactly in polynomial time for the special case in which all edge weights are equal to 1. This technique gives us a simple polynomial-time Wmax/Wmin-approximation algorithm for MAXMINO where wmax and wmin denote the maximum and minimum weights among all the input edges. Furthermore, we also observe that this approach yields an exact algorithm for the general case of MAXMINO whose running time is polynomial whenever the number of edges having weight larger than wmin is at most logarithmic in the number of vertices. Finally, we show that MAXMINO is solvable in polynomial time if the input is a cactus graph.

Original languageEnglish
Title of host publicationIPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium
DOIs
Publication statusPublished - Nov 25 2009
Event23rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2009 - Rome, Italy
Duration: May 23 2009May 29 2009

Other

Other23rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2009
CountryItaly
CityRome
Period5/23/095/29/09

Fingerprint

Polynomials
Directed graphs
Approximation algorithms
Scheduling

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Software

Cite this

Asahiro, Y., Jansso, J., Miyano, E., & Ono, H. (2009). Graph orientaion to maximize the minmum weighted outdegre. In IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium [5160872] https://doi.org/10.1109/IPDPS.2009.5160872

Graph orientaion to maximize the minmum weighted outdegre. / Asahiro, Yuichi; Jansso, Jesper; Miyano, Eiji; Ono, Hirotaka.

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium. 2009. 5160872.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Asahiro, Y, Jansso, J, Miyano, E & Ono, H 2009, Graph orientaion to maximize the minmum weighted outdegre. in IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium., 5160872, 23rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2009, Rome, Italy, 5/23/09. https://doi.org/10.1109/IPDPS.2009.5160872
Asahiro Y, Jansso J, Miyano E, Ono H. Graph orientaion to maximize the minmum weighted outdegre. In IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium. 2009. 5160872 https://doi.org/10.1109/IPDPS.2009.5160872
Asahiro, Yuichi ; Jansso, Jesper ; Miyano, Eiji ; Ono, Hirotaka. / Graph orientaion to maximize the minmum weighted outdegre. IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium. 2009.
@inproceedings{baf2c89ca05c499883582258415a46e0,
title = "Graph orientaion to maximize the minmum weighted outdegre",
abstract = "We study a new variant of the graph orientation problem called MAXMINO where the input is an undirected, edge-weighted graph and the objective is to assign a direction to each edge so that the minimum weighted outdegree (taken over all vertices in the resulting directed graph) is maximized. All edge weights are assumed to be positive integers. This problem is closely related to the job scheduling on parallel machines, called the machine covering problem, where its goal is to assign jobs to parallel machines such that each machine is covered as much as possible. First, we prove that MAXMINO is strongly NP-hard and cannot be approximated within a ratio of 2 - ε for any constant ε > 0 in polynomial time unless P-NP, even if all edge weights belong to {1,2}, every vertex has degree at most three, and the input graph is bipartite or planar. Next, we show how to solve MAXMINO exactly in polynomial time for the special case in which all edge weights are equal to 1. This technique gives us a simple polynomial-time Wmax/Wmin-approximation algorithm for MAXMINO where wmax and wmin denote the maximum and minimum weights among all the input edges. Furthermore, we also observe that this approach yields an exact algorithm for the general case of MAXMINO whose running time is polynomial whenever the number of edges having weight larger than wmin is at most logarithmic in the number of vertices. Finally, we show that MAXMINO is solvable in polynomial time if the input is a cactus graph.",
author = "Yuichi Asahiro and Jesper Jansso and Eiji Miyano and Hirotaka Ono",
year = "2009",
month = "11",
day = "25",
doi = "10.1109/IPDPS.2009.5160872",
language = "English",
isbn = "9781424437504",
booktitle = "IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium",

}

TY - GEN

T1 - Graph orientaion to maximize the minmum weighted outdegre

AU - Asahiro, Yuichi

AU - Jansso, Jesper

AU - Miyano, Eiji

AU - Ono, Hirotaka

PY - 2009/11/25

Y1 - 2009/11/25

N2 - We study a new variant of the graph orientation problem called MAXMINO where the input is an undirected, edge-weighted graph and the objective is to assign a direction to each edge so that the minimum weighted outdegree (taken over all vertices in the resulting directed graph) is maximized. All edge weights are assumed to be positive integers. This problem is closely related to the job scheduling on parallel machines, called the machine covering problem, where its goal is to assign jobs to parallel machines such that each machine is covered as much as possible. First, we prove that MAXMINO is strongly NP-hard and cannot be approximated within a ratio of 2 - ε for any constant ε > 0 in polynomial time unless P-NP, even if all edge weights belong to {1,2}, every vertex has degree at most three, and the input graph is bipartite or planar. Next, we show how to solve MAXMINO exactly in polynomial time for the special case in which all edge weights are equal to 1. This technique gives us a simple polynomial-time Wmax/Wmin-approximation algorithm for MAXMINO where wmax and wmin denote the maximum and minimum weights among all the input edges. Furthermore, we also observe that this approach yields an exact algorithm for the general case of MAXMINO whose running time is polynomial whenever the number of edges having weight larger than wmin is at most logarithmic in the number of vertices. Finally, we show that MAXMINO is solvable in polynomial time if the input is a cactus graph.

AB - We study a new variant of the graph orientation problem called MAXMINO where the input is an undirected, edge-weighted graph and the objective is to assign a direction to each edge so that the minimum weighted outdegree (taken over all vertices in the resulting directed graph) is maximized. All edge weights are assumed to be positive integers. This problem is closely related to the job scheduling on parallel machines, called the machine covering problem, where its goal is to assign jobs to parallel machines such that each machine is covered as much as possible. First, we prove that MAXMINO is strongly NP-hard and cannot be approximated within a ratio of 2 - ε for any constant ε > 0 in polynomial time unless P-NP, even if all edge weights belong to {1,2}, every vertex has degree at most three, and the input graph is bipartite or planar. Next, we show how to solve MAXMINO exactly in polynomial time for the special case in which all edge weights are equal to 1. This technique gives us a simple polynomial-time Wmax/Wmin-approximation algorithm for MAXMINO where wmax and wmin denote the maximum and minimum weights among all the input edges. Furthermore, we also observe that this approach yields an exact algorithm for the general case of MAXMINO whose running time is polynomial whenever the number of edges having weight larger than wmin is at most logarithmic in the number of vertices. Finally, we show that MAXMINO is solvable in polynomial time if the input is a cactus graph.

UR - http://www.scopus.com/inward/record.url?scp=70449823954&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70449823954&partnerID=8YFLogxK

U2 - 10.1109/IPDPS.2009.5160872

DO - 10.1109/IPDPS.2009.5160872

M3 - Conference contribution

SN - 9781424437504

BT - IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

ER -