{"_buckets": {"deposit": "6b5cec3e-e792-45cb-b041-a8c30762f4f9"}, "_deposit": {"id": "13174", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "13174"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00013174"}, "item_10_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2010-02-01", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "2", "bibliographicPageEnd": "292", "bibliographicPageStart": "290", "bibliographicVolumeNumber": "E93-D", "bibliographic_titles": [{"bibliographic_title": "IEICE transactions on information and systems"}]}]}, "item_10_description_4": {"attribute_name": "\u6284\u9332", "attribute_value_mlt": [{"subitem_description": "For a graph G, a biclique edge partition SBP(G) is a collection of bicliques (complete bipartite subgraphs) Bi such that each edge of G is contained in exactly one Bi. The Minimum Biclique Edge Partition Problem (MBEPP) asks for SBP(G) with the minimum size. In this paper, we show that for arbitrary small \u03b5\u003e0, (6053/6052-\u03b5)-approximation of MBEPP is NP-hard.", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "URI", "subitem_identifier_uri": "http://www.ieice.org/jpn/trans_online/index.html"}, {"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/15069"}]}, "item_10_publisher_32": {"attribute_name": "\u51fa\u7248\u8005", "attribute_value_mlt": [{"subitem_publisher": "Institute of Electronics, Information and Communication Engineers"}]}, "item_10_rights_12": {"attribute_name": "\u6a29\u5229", "attribute_value_mlt": [{"subitem_rights": "Copyright (C) 2010 IEICE"}]}, "item_10_select_15": {"attribute_name": "\u8457\u8005\u7248\u30d5\u30e9\u30b0", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0916-8532", "subitem_source_identifier_type": "ISSN"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "OTSUKI, Hideaki"}], "nameIdentifiers": [{"nameIdentifier": "41568", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "HIRATA, Tomio"}], "nameIdentifiers": [{"nameIdentifier": "41569", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "\u30d5\u30a1\u30a4\u30eb\u60c5\u5831", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-20"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "468.pdf", "filesize": [{"value": "157.7 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 157700.0, "url": {"label": "468.pdf", "url": "https://nagoya.repo.nii.ac.jp/record/13174/files/468.pdf"}, "version_id": "2a3a5ed8-879f-46e1-a6ed-3b04b2c71e51"}]}, "item_keyword": {"attribute_name": "\u30ad\u30fc\u30ef\u30fc\u30c9", "attribute_value_mlt": [{"subitem_subject": "biclique", "subitem_subject_scheme": "Other"}, {"subitem_subject": "edge partition", "subitem_subject_scheme": "Other"}, {"subitem_subject": "NP-hard", "subitem_subject_scheme": "Other"}, {"subitem_subject": "inapproximability", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "\u8a00\u8a9e", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "\u8cc7\u6e90\u30bf\u30a4\u30d7", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Inapproximability of the Minimum Biclique Edge Partition Problem", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "Inapproximability of the Minimum Biclique Edge Partition Problem"}]}, "item_type_id": "10", "owner": "1", "path": ["320/321/322"], "permalink_uri": "http://hdl.handle.net/2237/15069", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "attribute_name_i18n": "\u516c\u958b\u65e5", "attribute_value": "2011-07-13"}, "publish_date": "2011-07-13", "publish_status": "0", "recid": "13174", "relation": {}, "relation_version_is_last": true, "title": ["Inapproximability of the Minimum Biclique Edge Partition Problem"], "weko_shared_id": null}