{"_buckets": {"deposit": "f8a670cf-dcaf-4945-9b34-afaa2b1327ee"}, "_deposit": {"created_by": 14, "id": "2000128", "owner": "14", "owners": [14], "owners_ext": {"displayname": "九工大 水野", "username": "mizuno_q_kodai"}, "pid": {"revision_id": 0, "type": "depid", "value": "2000128"}, "status": "published"}, "_oai": {"id": "oai:kyutech.repo.nii.ac.jp:02000128", "sets": ["9"]}, "author_link": ["6037"], "control_number": "2000128", "item_21_alternative_title_18": {"attribute_name": "その他のタイトル", "attribute_value_mlt": [{"subitem_alternative_title": "GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE", "subitem_alternative_title_language": "en"}]}, "item_21_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2011", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "03", "bibliographicPageEnd": "601", "bibliographicPageStart": "583", "bibliographicVolumeNumber": "22", "bibliographic_titles": [{"bibliographic_title": "International Journal of Foundations of Computer Science", "bibliographic_titleLang": "en"}]}]}, "item_21_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "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 ε \u003e 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 wmaz/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.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_21_link_62": {"attribute_name": "研究者情報", "attribute_value_mlt": [{"subitem_link_url": "https://hyokadb02.jimu.kyutech.ac.jp/html/233_ja.html"}]}, "item_21_publisher_7": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "World Scientific Publishing"}]}, "item_21_relation_12": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://doi.org/10.1142/S0129054111008246", "subitem_relation_type_select": "DOI"}}]}, "item_21_rights_13": {"attribute_name": "著作権関連情報", "attribute_value_mlt": [{"subitem_rights": "Electronic version of an article published as International Journal of Foundations of Computer Science, VOL. 22, NO. 03 https://doi.org/10.1142/S0129054111008246 © copyright World Scientific Publishing Company, https://www.worldscientific.com/worldscinet/ijfcs."}]}, "item_21_select_59": {"attribute_name": "査読の有無", "attribute_value_mlt": [{"subitem_select_item": "yes"}]}, "item_21_source_id_8": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0129-0541", "subitem_source_identifier_type": "PISSN"}, {"subitem_source_identifier": "1793-6373", "subitem_source_identifier_type": "EISSN"}]}, "item_21_version_type_58": {"attribute_name": "出版タイプ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_ab4af688f83e57aa", "subitem_version_type": "AM"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Asahiro, Yuichi", "creatorNameLang": "en"}]}, {"creatorNames": [{"creatorName": "Jansson, Jesper", "creatorNameLang": "en"}]}, {"creatorAffiliations": [{"affiliationNameIdentifiers": [], "affiliationNames": [{"affiliationName": "", "affiliationNameLang": "ja"}]}], "creatorNames": [{"creatorName": "Miyano, Eiji", "creatorNameLang": "en"}, {"creatorName": "宮野, 英次", "creatorNameLang": "ja"}, {"creatorName": "ミヤノ, エイジ", "creatorNameLang": "ja-Kana"}], "familyNames": [{"familyName": "Miyano", "familyNameLang": "en"}, {"familyName": "宮野", "familyNameLang": "ja"}, {"familyName": "ミヤノ", "familyNameLang": "ja-Kana"}], "givenNames": [{"givenName": "Eiji", "givenNameLang": "en"}, {"givenName": "英次", "givenNameLang": "ja"}, {"givenName": "エイジ", "givenNameLang": "ja-Kana"}], "nameIdentifiers": [{"nameIdentifier": "6037", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "10284548", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://nrid.nii.ac.jp/ja/nrid/1000010284548"}, {"nameIdentifier": "6603649200", "nameIdentifierScheme": "Scopus著者ID", "nameIdentifierURI": "https://www.scopus.com/authid/detail.uri?authorId=6603649200"}, {"nameIdentifier": "0000-0002-4260-7818", "nameIdentifierScheme": "ORCiD", "nameIdentifierURI": "https://orcid.org/0000-0002-4260-7818"}, {"nameIdentifier": "233", "nameIdentifierScheme": "九工大研究者情報", "nameIdentifierURI": "https://hyokadb02.jimu.kyutech.ac.jp/html/233_ja.html"}]}, {"creatorNames": [{"creatorName": "Ono, Hirotaka", "creatorNameLang": "en"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2023-10-02"}], "download_preview_message": "", "file_order": 0, "filename": "10347757.pdf", "filesize": [{"value": "331 KB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "mimetype": "application/pdf", "size": 331000.0, "url": {"url": "https://kyutech.repo.nii.ac.jp/record/2000128/files/10347757.pdf"}, "version_id": "5bec3574-2902-48af-ba9d-b663a390eea5"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Graph orientation", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Approximation algorithm", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Hardness of approximation", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Scheduling", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Maximum flow", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Graph Orientation to Maximize the Minimum Weighted Outdegree", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Graph Orientation to Maximize the Minimum Weighted Outdegree", "subitem_title_language": "en"}]}, "item_type_id": "21", "owner": "14", "path": ["9"], "permalink_uri": "http://hdl.handle.net/10228/0002000128", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2023-10-02"}, "publish_date": "2023-10-02", "publish_status": "0", "recid": "2000128", "relation": {}, "relation_version_is_last": true, "title": ["Graph Orientation to Maximize the Minimum Weighted Outdegree"], "weko_shared_id": -1}
Graph Orientation to Maximize the Minimum Weighted Outdegree
http://hdl.handle.net/10228/0002000128
http://hdl.handle.net/10228/0002000128