{"created":"2021-03-01T07:09:46.362365+00:00","id":48952,"links":{},"metadata":{"_buckets":{"deposit":"b5e7c4e3-f62a-4655-b7ec-3cfe62358200"},"_deposit":{"id":"48952","owners":[],"pid":{"revision_id":0,"type":"depid","value":"48952"},"status":"published"},"_oai":{"id":"oai:repository.dl.itc.u-tokyo.ac.jp:00048952","sets":["34:95:96","9:10:15"]},"item_2_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1991-04-25","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicPageEnd":"668","bibliographicPageStart":"665","bibliographicVolumeNumber":"E74-A","bibliographic_titles":[{"bibliographic_title":"IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences"}]}]},"item_2_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"This paper gives an O(n log n)-time algorithm for the following problem: min Σni=1|xi-ai| s.t.x1≦x2≦...≦xn where ai(i=1, ..., n) are given constants and xi(i=1, ..., n) are variables. There has been given an O(n2)-time incremental algorithm, and we improve it by using the heap as a data structure and modify the incremental algorithm partly. This problem is a kind of the geometric fitting problem between two corresponding sets of points on a line which is related to some VLSI layout design problem.","subitem_description_type":"Abstract"}]},"item_2_description_6":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"Special Section PAPER (Special Issue on Discrete Mathematics and Its Applications)","subitem_description_type":"Other"}]},"item_2_publisher_20":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Institute of Electronics, Information and Communication Engineers"}]},"item_2_relation_25":{"attribute_name":"関係URI","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://search.ieice.org/","subitem_relation_type_select":"URI"}}]},"item_2_rights_12":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"copyright©1991 IEICE"}]},"item_2_select_14":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_select_item":"publisher"}]},"item_2_text_4":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, University of Tokyo"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"IMAI, Hiroshi"}],"nameIdentifiers":[{"nameIdentifier":"145466","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-12-15"}],"displaytype":"detail","filename":"A Geometric Fitting Problem of Two Corresponding Sets of Points on a Line  1991.pdf","filesize":[{"value":"294.8 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"A Geometric Fitting Problem of Two Corresponding Sets of Points on a Line  1991.pdf","url":"https://repository.dl.itc.u-tokyo.ac.jp/record/48952/files/A Geometric Fitting Problem of Two Corresponding Sets of Points on a Line  1991.pdf"},"version_id":"6030b861-6ddb-4fb2-b6a8-8c6d15d41607"}]},"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":"A Geometric Fitting Problem of Two Corresponding Sets of Points on a Line","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Geometric Fitting Problem of Two Corresponding Sets of Points on a Line"}]},"item_type_id":"2","owner":"1","path":["15","96"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-12-14"},"publish_date":"2017-12-14","publish_status":"0","recid":"48952","relation_version_is_last":true,"title":["A Geometric Fitting Problem of Two Corresponding Sets of Points on a Line"],"weko_creator_id":"1","weko_shared_id":null},"updated":"2022-12-19T04:23:38.708994+00:00"}