{"id":"https://openalex.org/W1902065897","doi":"https://doi.org/10.1137/15m101926x","title":"On $k$-Submodular Relaxation","display_name":"On $k$-Submodular Relaxation","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W1902065897","doi":"https://doi.org/10.1137/15m101926x","mag":"1902065897"},"language":"en","primary_location":{"id":"doi:10.1137/15m101926x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m101926x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1504.07830","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Hiroshi Hirai","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hiroshi Hirai","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Yuni Iwamasa","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuni Iwamasa","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7971,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.85516129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"30","issue":"3","first_page":"1726","last_page":"1736"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9779000282287598,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9779000282287598,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.006599999964237213,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.0017999999690800905,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.7911999821662903},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.6521000266075134},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6082000136375427},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5205000042915344},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.48100000619888306},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.38499999046325684}],"concepts":[{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.7911999821662903},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7519000172615051},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.6521000266075134},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6082000136375427},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5205000042915344},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.48100000619888306},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46630001068115234},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4553000032901764},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.38499999046325684},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33570000529289246},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30889999866485596},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.3059999942779541},{"id":"https://openalex.org/C139676723","wikidata":"https://www.wikidata.org/wiki/Q1193832","display_name":"Sign (mathematics)","level":2,"score":0.3050000071525574},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.27810001373291016},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2727999985218048},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.26589998602867126},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.25600001215934753},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.25220000743865967}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/15m101926x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m101926x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1504.07830","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1504.07830","pdf_url":"https://arxiv.org/pdf/1504.07830","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1504.07830","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1504.07830","pdf_url":"https://arxiv.org/pdf/1504.07830","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G103383452","display_name":"\u6226\u4e89\u306e\u8af8\u539f\u56e0\u3068\u5e73\u548c\u306e\u8af8\u6761\u4ef6\u306b\u95a2\u3059\u308b\u79d1\u5b66\u7684\u7814\u7a76(\u5e73\u548c\u7814\u7a76)\u2015\u3068\u304f\u306b\u56fd\u969b\u4e3b\u7fa9\u3068\u6c11\u65cf\u4e3b\u7fa9, \u8ecd\u7e2e\u306e\u7d4c\u6e08\u7684\u30fb\u793e\u4f1a\u7684\u5f71\u97ff, \u56fd\u969b\u6587\u5316\u5354\u529b\u3092\u4e2d\u5fc3\u306b\u2015","funder_award_id":"33002","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G3238366090","display_name":null,"funder_award_id":"25280004","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G3812730929","display_name":null,"funder_award_id":"26280004","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G5125385199","display_name":null,"funder_award_id":"26330023","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7443101468","display_name":"\u8d85\u9ad8\u901f\u73fe\u8c61\u6e2c\u5b9a\u88c5\u7f6e\u306e\u8a66\u4f5c\u3068\u305d\u306e\u6d77\u6d0b\u7814\u7a76\u3078\u306e\u5fdc\u7528","funder_award_id":"80004","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"},{"id":"https://openalex.org/F4320338112","display_name":"Exploratory Research for Advanced Technology","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1568640725","https://openalex.org/W1771852678","https://openalex.org/W2069782150","https://openalex.org/W2081691457","https://openalex.org/W2570081448","https://openalex.org/W2950298732"],"related_works":[],"abstract_inverted_index":{"$k$-submodular":[0,20,33,77,96,128,140,146],"functions,":[1],"introduced":[2],"by":[3,32,48],"Huber":[4],"and":[5,29,130,171],"Kolmogorov,":[6],"are":[7],"functions":[8,21,34,124],"defined":[9],"on":[10,105],"$\\{0,":[11],"1,":[12,82],"2,":[13,61,83,107],"\\dots,":[14,62,84,108],"k\\}^n$":[15,109],"satisfying":[16],"certain":[17],"submodular-type":[18],"inequalities.":[19],"typically":[22],"arise":[23],"as":[24],"relaxations":[25,31],"of":[26,40,98,103,120,122,190],"NP-hard":[27],"problems,":[28],"the":[30,52,101,123,158,174,183],"play":[35],"key":[36],"roles":[37],"in":[38,118],"design":[39],"efficient,":[41],"approximation,":[42],"or":[43,142],"fixed-parameter":[44],"tractable":[45],"algorithms.":[46],"Motivated":[47],"this,":[49],"we":[50],"consider":[51],"following":[53],"problem:":[54],"Given":[55],"a":[56,76,95,116,127,133,139,145,168],"function":[57,78,160,176],"$f":[58],":":[59,80],"\\{1,":[60],"k\\}^n":[63,85],"\\rightarrow":[64,86],"\\mathbb{R}":[65,87],"\\cup":[66,88],"\\{+":[67,89],"\\infty\\}$,":[68,90],"determine":[69],"whether":[70],"$f$":[71],"can":[72],"be":[73],"extended":[74],"to":[75,112,137,193],"$g":[79],"\\{0,":[81],"where":[91],"$g$":[92,104],"is":[93,110,161,177],"called":[94],"relaxation":[97,141,147],"$f$,":[99],"i.e.,":[100],"restriction":[102],"$\\{1,":[106],"equal":[111],"$f$.":[113],"We":[114,187],"give":[115,132],"characterization,":[117],"terms":[119],"polymorphisms,":[121],"which":[125],"admit":[126],"relaxation,":[129,170],"also":[131],"combinatorial":[134],"$O((k^n)^2)$-time":[135],"algorithm":[136,152,166,181,192],"find":[138],"establish":[143],"that":[144],"does":[148],"not":[149],"exist.":[150],"Our":[151],"has":[153],"interesting":[154],"properties:":[155],"(1)":[156],"If":[157],"input":[159,175],"integer":[162],"valued,":[163],"then":[164,179],"our":[165,180,191],"outputs":[167,182],"half-integral":[169],"(2)":[172],"if":[173],"binary,":[178],"unique":[184],"optimal":[185],"relaxation.":[186],"present":[188],"applications":[189],"valued":[194],"constraint":[195],"satisfaction":[196],"problems.":[197]},"counts_by_year":[{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2016-06-24T00:00:00"}