{"id":"https://openalex.org/W2089718638","doi":"https://doi.org/10.1145/1552285.1552286","title":"A measure & conquer approach for the analysis of exact algorithms","display_name":"A measure & conquer approach for the analysis of exact algorithms","publication_year":2009,"publication_date":"2009-08-01","ids":{"openalex":"https://openalex.org/W2089718638","doi":"https://doi.org/10.1145/1552285.1552286","mag":"2089718638"},"language":"en","primary_location":{"id":"doi:10.1145/1552285.1552286","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1552285.1552286","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["University of Bergen, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034276567","display_name":"Fabrizio Grandoni","orcid":"https://orcid.org/0000-0002-9676-4931"},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Fabrizio Grandoni","raw_affiliation_strings":["University of Rome Tor Vergata, Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Rome Tor Vergata, Rome, Italy","institution_ids":["https://openalex.org/I116067653"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109894460","display_name":"Dieter Kratsch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dieter Kratsch","raw_affiliation_strings":["University Paul Verlaine - Metz, Metz, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University Paul Verlaine - Metz, Metz, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":25.5291,"has_fulltext":false,"cited_by_count":240,"citation_normalized_percentile":{"value":0.99781232,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"56","issue":"5","first_page":"1","last_page":"32"},"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.9995999932289124,"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.9995999932289124,"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.9991999864578247,"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/T10142","display_name":"Formal Methods in Verification","score":0.9955000281333923,"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/measure","display_name":"Measure (data warehouse)","score":0.808139979839325},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6455824375152588},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.6330069303512573},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.581804633140564},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5613247156143188},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.536474883556366},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5217817425727844},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5176796913146973},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4206532835960388},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41429102420806885},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40052059292793274},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.09902280569076538}],"concepts":[{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.808139979839325},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6455824375152588},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.6330069303512573},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.581804633140564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5613247156143188},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.536474883556366},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5217817425727844},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5176796913146973},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4206532835960388},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41429102420806885},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40052059292793274},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.09902280569076538},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1552285.1552286","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1552285.1552286","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:art.torvergata.it:2108/30107","is_oa":false,"landing_page_url":"http://hdl.handle.net/2108/30107","pdf_url":null,"source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"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":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":80,"referenced_works":["https://openalex.org/W173980447","https://openalex.org/W197843346","https://openalex.org/W1479863711","https://openalex.org/W1493071618","https://openalex.org/W1495910828","https://openalex.org/W1500660230","https://openalex.org/W1501644705","https://openalex.org/W1533811829","https://openalex.org/W1547251600","https://openalex.org/W1549137733","https://openalex.org/W1563108031","https://openalex.org/W1564428908","https://openalex.org/W1570370412","https://openalex.org/W1572075663","https://openalex.org/W1573405943","https://openalex.org/W1581812120","https://openalex.org/W1582963151","https://openalex.org/W1584965761","https://openalex.org/W1593916827","https://openalex.org/W1666834859","https://openalex.org/W1890324419","https://openalex.org/W1969186119","https://openalex.org/W1971756951","https://openalex.org/W1975286948","https://openalex.org/W1979753555","https://openalex.org/W1983992721","https://openalex.org/W1984481156","https://openalex.org/W1988434420","https://openalex.org/W1995725694","https://openalex.org/W1999216089","https://openalex.org/W2002425091","https://openalex.org/W2003159902","https://openalex.org/W2007200873","https://openalex.org/W2014111643","https://openalex.org/W2014430206","https://openalex.org/W2026771935","https://openalex.org/W2027049731","https://openalex.org/W2036185701","https://openalex.org/W2038049091","https://openalex.org/W2040813792","https://openalex.org/W2043841752","https://openalex.org/W2045492613","https://openalex.org/W2047470084","https://openalex.org/W2049136377","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2066749637","https://openalex.org/W2073025989","https://openalex.org/W2077580276","https://openalex.org/W2081254453","https://openalex.org/W2084732238","https://openalex.org/W2085870956","https://openalex.org/W2094077034","https://openalex.org/W2096495231","https://openalex.org/W2097844290","https://openalex.org/W2099474653","https://openalex.org/W2104739701","https://openalex.org/W2106457067","https://openalex.org/W2112825968","https://openalex.org/W2119774304","https://openalex.org/W2122639972","https://openalex.org/W2124240997","https://openalex.org/W2126186592","https://openalex.org/W2126442135","https://openalex.org/W2127390687","https://openalex.org/W2149719182","https://openalex.org/W2151708662","https://openalex.org/W2152302158","https://openalex.org/W2156223756","https://openalex.org/W2163938320","https://openalex.org/W2171680292","https://openalex.org/W2283515028","https://openalex.org/W2508797883","https://openalex.org/W2570469658","https://openalex.org/W2913688336","https://openalex.org/W3148190347","https://openalex.org/W4236097879","https://openalex.org/W4285719527","https://openalex.org/W4292230561","https://openalex.org/W6628682275"],"related_works":["https://openalex.org/W2027065553","https://openalex.org/W2760348722","https://openalex.org/W2783885583","https://openalex.org/W2120095724","https://openalex.org/W2368326437","https://openalex.org/W1631221657","https://openalex.org/W2357479099","https://openalex.org/W2364309619","https://openalex.org/W2371864976","https://openalex.org/W160089862"],"abstract_inverted_index":{"For":[0,156,181],"more":[1,208],"than":[2],"40":[3],"years,":[4],"Branch":[5],"&":[6,56,141],"Reduce":[7],"exponential-time":[8],"backtracking":[9],"algorithms":[10,34,210,232],"have":[11,235],"been":[12],"among":[13],"the":[14,28,71,79,90,94,111,137,157,162,182,200,222,226,240],"most":[15],"common":[16],"tools":[17],"used":[18,86],"for":[19,179],"finding":[20],"exact":[21,231],"solutions":[22],"of":[23,74,78,110,139,221,230],"NP-hard":[24,147],"problems.":[25],"Despite":[26],"that,":[27],"way":[29],"to":[30,61,87,121,126,135,169],"analyze":[31],"such":[32,64],"recursive":[33],"is":[35,68,84,102,197],"still":[36],"far":[37,207],"from":[38],"producing":[39],"tight":[40],"worst-case":[41,130],"running":[42,176,195,241],"time":[43,131,177,196,203,242],"bounds.":[44],"Motivated":[45],"by":[46,93],"this,":[47],"we":[48,53,143,160,185],"use":[49],"an":[50,59],"approach,":[51],"that":[52,103,113,193,217],"call":[54],"\u201cMeasure":[55],"Conquer\u201d,":[57],"as":[58],"attempt":[60],"step":[62],"beyond":[63],"limitations.":[65],"The":[66,100],"approach":[67],"based":[69],"on":[70,239],"careful":[72],"design":[73],"a":[75,104,114,127,170,173,187,218,236],"nonstandard":[76],"measure":[77,83,106,116],"subproblem":[80],"size;":[81],"this":[82],"then":[85],"lower":[88],"bound":[89,178],"progress":[91],"made":[92,224],"algorithm":[95,112],"at":[96],"each":[97],"branching":[98],"step.":[99],"idea":[101],"smarter":[105],"may":[107],"capture":[108],"behaviors":[109],"standard":[115,212],"might":[117],"not":[118],"be":[119],"able":[120],"exploit,":[122],"and":[123,152,166,191],"hence":[124],"lead":[125],"significantly":[128],"better":[129,171],"analysis.":[132],"In":[133],"order":[134],"show":[136,192,216],"potentialities":[138],"Measure":[140],"Conquer,":[142],"consider":[144,161],"two":[145],"well-studied":[146],"problems:":[148],"minimum":[149],"dominating":[150],"set":[151],"maximum":[153],"independent":[154],"set.":[155],"first":[158,228],"problem,":[159,184],"current":[163,201],"best":[164,202],"algorithm,":[165,190],"prove":[167],"(thanks":[168],"measure)":[172],"much":[174],"tighter":[175],"it.":[180],"second":[183],"describe":[186],"new,":[188],"simple":[189],"its":[194],"competitive":[198],"with":[199,206],"bounds,":[204],"achieved":[205],"complicated":[209],"(and":[211],"analysis).":[213],"Our":[214],"examples":[215],"good":[219],"choice":[220],"measure,":[223],"in":[225],"very":[227],"stages":[229],"design,":[233],"can":[234],"tremendous":[237],"impact":[238],"bounds":[243],"achievable.":[244]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":20},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":24}],"updated_date":"2026-06-27T08:28:00.272161","created_date":"2025-10-10T00:00:00"}