{"id":"https://openalex.org/W1936740984","doi":"https://doi.org/10.48550/arxiv.1409.8135","title":"A note on the Minimum Norm Point algorithm","display_name":"A note on the Minimum Norm Point algorithm","alternate_titles":[],"publication_year":2014,"publication_date":"2014-09-29","ids":{"openalex":"https://openalex.org/W1936740984","doi":"https://doi.org/10.48550/arxiv.1409.8135","mag":"1936740984"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:1409.8135","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1409.8135","pdf_url":"https://arxiv.org/pdf/1409.8135","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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"},"parent_works":[],"lineage":["https://openalex.org/W1936740984"],"child_works_count":0,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1409.8135","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063270684","display_name":"Igor Stassiy","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Stassiy, Igor","raw_affiliation_strings":["University of Saarland Saarbruecken , Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Saarland Saarbruecken , Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063270684"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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.9994999766349792,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodularity","display_name":"submodular functions","score":0.8109999895095825},{"id":"https://openalex.org/keywords/submodular-minimization","display_name":"submodular minimization","score":0.8659999966621399},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"minimum cut","score":0.6930000185966492},{"id":"https://openalex.org/keywords/strongly-polynomial-algorithms","display_name":"strongly polynomial algorithms","score":0.6150000095367432},{"id":"https://openalex.org/keywords/algorithm-implementation","display_name":"algorithm implementation","score":0.5709999799728394},{"id":"https://openalex.org/keywords/practical-performance","display_name":"practical performance","score":0.33399999141693115}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9250674247741699},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5659499168395996},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.5545411109924316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5073508620262146},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4434424936771393},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.43712061643600464},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4184553027153015},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41331803798675537},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3482610583305359},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3435974419116974},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32803821563720703},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:1409.8135","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1409.8135","pdf_url":"https://arxiv.org/pdf/1409.8135","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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"},{"id":"doi:10.48550/arxiv.1409.8135","doi":"https://doi.org/10.48550/arxiv.1409.8135","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1409.8135","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.741.4959","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.741.4959","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1409.8135.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1409.8135","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1409.8135","pdf_url":"https://arxiv.org/pdf/1409.8135","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1936740984.pdf","grobid_xml":"https://content.openalex.org/works/W1936740984.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W2127124058","https://openalex.org/W2128059732","https://openalex.org/W2258857078","https://openalex.org/W7098981303"],"related_works":["https://openalex.org/W2319101901","https://openalex.org/W7098981303","https://openalex.org/W2148391549","https://openalex.org/W2107877543","https://openalex.org/W7100499203","https://openalex.org/W7098046367","https://openalex.org/W4239797293","https://openalex.org/W2045687732","https://openalex.org/W1599232611","https://openalex.org/W7223050716"],"abstract_inverted_index":{"We":[0,78],"present":[1,79],"a":[2,29],"provably":[3],"more":[4],"efficient":[5],"implementation":[6,82],"of":[7,31,83,111],"the":[8,17,25,44,47,57,84,103,106],"Minimum":[9],"Norm":[10],"Point":[11],"Algorithm":[12],"conceived":[13],"by":[14],"Fujishige":[15],"than":[16],"one":[18],"presented":[19],"in":[20,43,64,100],"\\cite{FUJI06}.":[21],"The":[22],"algorithm":[23,107],"solves":[24],"minimization":[26],"problem":[27,58],"for":[28,86,114],"class":[30],"functions":[32],"known":[33,55,70],"as":[34,40],"submodular.":[35],"Many":[36],"important":[37],"functions,":[38],"such":[39],"minimum":[41],"cut":[42],"graph,":[45],"have":[46],"so":[48],"called":[49],"submodular":[50,116],"property":[51],"\\cite{FUJI82}.":[52],"It":[53],"is":[54],"that":[56],"can":[59],"also":[60],"be":[61],"efficiently":[62],"solved":[63],"strongly":[65],"polynomial":[66],"time":[67],"\\cite{IWAT01},":[68],"however":[69],"theoretical":[71],"bounds":[72,92],"are":[73,93],"far":[74],"from":[75],"being":[76],"practical.":[77],"an":[80,109],"improved":[81],"algorithm,":[85],"which":[87,96],"unfortunately":[88],"no":[89],"worst":[90],"case":[91],"know,":[94],"but":[95],"performs":[97,108],"very":[98],"well":[99],"practice.":[101],"With":[102],"modifications":[104],"presented,":[105],"order":[110],"magnitude":[112],"faster":[113],"certain":[115],"functions.":[117]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1936740984","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
