{"id":"https://openalex.org/W2189097266","doi":null,"title":"Persistency for higher-order pseudo-boolean maximization.","display_name":"Persistency for higher-order pseudo-boolean maximization.","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2189097266","mag":"2189097266"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.662.3481","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.662.3481","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://tinytocs.org/vol1/papers/tinytocs-v1-strandmark.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014742486","display_name":"Petter Strandmark","orcid":"https://orcid.org/0000-0002-9795-2694","observed_orcids":["https://orcid.org/0000-0002-9795-2694"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Petter Strandmark","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-9795-2694","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5014742486"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":null,"last_page":null},"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.5673999786376953,"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.5673999786376953,"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.24959999322891235,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.04479999840259552,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pseudo-boolean-functions","display_name":"pseudo-Boolean functions","score":0.8330000042915344},{"id":"https://openalex.org/keywords/persistency","display_name":"persistency","score":0.6679999828338623},{"id":"https://openalex.org/keywords/image-segmentation","display_name":"image segmentation","score":0.5479999780654907},{"id":"https://openalex.org/keywords/submodularity","display_name":"submodular functions","score":0.5540000200271606},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.33899998664855957},{"id":"https://openalex.org/keywords/0-1-integer-programming","display_name":"0-1 integer programming","score":0.6100000143051147}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.7254761457443237},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6236101388931274},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4934610426425934},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4839751720428467},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.47733670473098755},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4458092153072357},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.4456442892551422},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.41113603115081787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39131760597229004},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.3562423586845398},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34731441736221313},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.305391788482666},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21008288860321045},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.662.3481","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.662.3481","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://tinytocs.org/vol1/papers/tinytocs-v1-strandmark.pdf","raw_type":"text"},{"id":"mag:2189097266","doi":null,"is_oa":false,"landing_page_url":"http://tinytocs.ece.utexas.edu/vol1/papers/tinytocs-v1-strandmark.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306532991","display_name":"Tiny Trans. Comput. Sci.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Tiny Trans. Comput. Sci.","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2006293258","https://openalex.org/W2013415302","https://openalex.org/W2074078071"],"related_works":["https://openalex.org/W7100164506","https://openalex.org/W2502472630","https://openalex.org/W1855173132","https://openalex.org/W2293594289","https://openalex.org/W3149351089","https://openalex.org/W6986317119","https://openalex.org/W1984640425","https://openalex.org/W6903600387","https://openalex.org/W7096364310","https://openalex.org/W1604259807"],"abstract_inverted_index":{"A":[0,59,181],"pseudo-Boolean":[1,13,57,64,121,175,182],"function":[2,5,183],"is":[3,15,67,81,99,139,184],"a":[4,7,16,33,78,89,100,105,185,195],"from":[6],"0/1-vector":[8],"to":[9,55,107,112,127,174],"the":[10,26,83,86,108,113,128,132,145,160],"reals.":[11],"Minimizing":[12],"functions":[14,65,122,164,176],"very":[17,153],"general":[18],"problem":[19,27,110,197],"with":[20],"many":[21],"applications.":[22],"In":[23],"image":[24,41],"analysis,":[25],"arises":[28],"in":[29,35,50,147],"segmentation":[30],"or":[31],"as":[32,53,191],"subroutine":[34],"task":[36],"like":[37],"stero":[38],"estimation":[39],"and":[40,95],"denoising.":[42],"Recent":[43],"years":[44],"have":[45],"seen":[46],"an":[47],"increased":[48],"interest":[49],"higher-degree":[51],"problems,":[52],"opposed":[54],"quadratic":[56,63,129,163],"functions.":[58],"method":[60],"for":[61,116,143,162],"minimizing":[62],"approximately":[66],"roof":[68],"duality":[69],"[1].":[70,137,187],"One":[71],"of":[72,92,134,152,177],"its":[73,189],"important":[74],"properties":[75],"besides":[76],"providing":[77],"lower":[79],"bound":[80],"persistency:":[82],"fact":[84],"that":[85,102,159],"approximation":[87],"gives":[88],"partial":[90,114],"solution":[91,106,115],"0,":[93],"1,":[94],"\u201cunknown.":[96],"\u201d":[97],"This":[98,138,156],"certificate":[101],"there":[103],"exists":[104],"original":[109],"equal":[111],"all":[117],"known":[118],"variables.":[119],"Higher-order":[120],"can":[123],"always":[124,141],"be":[125],"reduced":[126],"case":[130],"by":[131],"in-troduction":[133],"additional":[135],"variables":[136],"not":[140],"satisfactory,":[142],"example,":[144],"approach":[146,161],"[1]":[148],"introduces":[149],"non-submodular":[150],"terms":[151],"high":[154],"magnitude.":[155],"paper":[157],"shows":[158],"originally":[165],"based":[166],"on":[167],"vertex":[168,192],"pack-ing":[169],"[2,3]":[170],"readily":[171],"carries":[172],"over":[173],"higher":[178],"degree.":[179],"BODY":[180],"posiform":[186],"Write":[188],"maximization":[190],"packing.":[193],"Solve":[194],"bipartite":[196],"[3];":[198],"et":[199],"voila\u0300:":[200],"persistency!":[201]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2016-06-24T00:00:00"}