{"id":"https://openalex.org/W2614825977","doi":"https://doi.org/10.1137/120883736","title":"Hitting and Harvesting Pumpkins","display_name":"Hitting and Harvesting Pumpkins","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2614825977","doi":"https://doi.org/10.1137/120883736","mag":"2614825977"},"language":"en","primary_location":{"id":"doi:10.1137/120883736","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120883736","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/1105.2704","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Gwena\u00ebl Joret","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gwena\u00ebl Joret","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Christophe Paul","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christophe Paul","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Ignasi Sau","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ignasi Sau","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Saket Saurabh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"St\u00e9phan Thomass\u00e9","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"St\u00e9phan Thomass\u00e9","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.7448,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.94762004,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"28","issue":"3","first_page":"1363","last_page":"1390"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.5113999843597412,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.5113999843597412,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.11110000312328339,"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.07660000026226044,"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/disjoint-sets","display_name":"Disjoint sets","score":0.5404999852180481},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5246000289916992},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5072000026702881},{"id":"https://openalex.org/keywords/hypercube-graph","display_name":"Hypercube graph","score":0.4909000098705292},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4544999897480011},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.4544000029563904},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.4478999972343445},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4456000030040741},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.44209998846054077},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.37599998712539673}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7900999784469604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7174999713897705},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5404999852180481},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5246000289916992},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5072000026702881},{"id":"https://openalex.org/C80763892","wikidata":"https://www.wikidata.org/wiki/Q958394","display_name":"Hypercube graph","level":5,"score":0.4909000098705292},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4544999897480011},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.4544000029563904},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.4478999972343445},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4456000030040741},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.44209998846054077},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4415000081062317},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.37599998712539673},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.37130001187324524},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.3610999882221222},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.35420000553131104},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3508000075817108},{"id":"https://openalex.org/C199277547","wikidata":"https://www.wikidata.org/wiki/Q5872687","display_name":"Hitting time","level":2,"score":0.3490000069141388},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.3366999924182892},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.3257000148296356},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.32170000672340393},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.321399986743927},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.3192000091075897},{"id":"https://openalex.org/C45725084","wikidata":"https://www.wikidata.org/wiki/Q4390447","display_name":"Biconnected graph","level":5,"score":0.30090001225471497},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.30079999566078186},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.2971999943256378},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.29120001196861267},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.2881999909877777},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.28360000252723694},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.2784000039100647}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/120883736","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120883736","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:1105.2704","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1105.2704","pdf_url":"https://arxiv.org/pdf/1105.2704","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,"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":"pmh:oai:HAL:hal-01178192v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01178192","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Discrete Mathematics, 2014, 28 (3), pp.1363-1390. ⟨10.1137/120883736⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/172709","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/172709","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM journal on discrete mathematics, 28 (3","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1105.2704","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1105.2704","pdf_url":"https://arxiv.org/pdf/1105.2704","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,"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/G1415295610","display_name":"GRAphs through TOpological Structures","funder_award_id":"ANR-09-JCJC-0041","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G3727024547","display_name":"Algorithmes de graphes parametres et exacts","funder_award_id":"ANR-09-BLAN-0159","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1971393213","https://openalex.org/W1972577597","https://openalex.org/W1976430052","https://openalex.org/W1976760940","https://openalex.org/W1995725694","https://openalex.org/W2005079828","https://openalex.org/W2009147258","https://openalex.org/W2015905456","https://openalex.org/W2024517697","https://openalex.org/W2043985142","https://openalex.org/W2051856222","https://openalex.org/W2057826895","https://openalex.org/W2059372025","https://openalex.org/W2059451253","https://openalex.org/W2102159495","https://openalex.org/W2142055019","https://openalex.org/W2157295389","https://openalex.org/W2332112754","https://openalex.org/W4210756314"],"related_works":[],"abstract_inverted_index":{"The":[0],"$c$-pumpkin":[1],"is":[2,21],"the":[3,66,120,133],"graph":[4,19,64],"with":[5,139],"two":[6],"vertices":[7,30,144],"linked":[8],"by":[9,99],"$c":[10,90],"\\geq":[11,91],"1$":[12],"parallel":[13],"edges.":[14],"A":[15],"$c$-pumpkin-model":[16],"in":[17,48,61,65,82],"a":[18,22,35,62,76,140,147],"$G$":[20,49],"pair":[23],"$\\{A,":[24],"B\\}$":[25],"of":[26,29,31,38,68,135,143,150],"disjoint":[27],"subsets":[28],"$G$,":[32,39],"each":[33],"inducing":[34],"connected":[36],"subgraph":[37],"such":[40],"that":[41],"there":[42],"are":[43],"at":[44,100],"least":[45],"$c$":[46],"edges":[47],"between":[50],"$A$":[51],"and":[52,58,71,113,145],"$B$.":[53],"We":[54,74],"focus":[55],"on":[56],"hitting":[57,136],"packing":[59,146],"$c$-pumpkin-models":[60,95,138],"given":[63],"realm":[67],"approximation":[69],"algorithms":[70,109],"parameterized":[72],"algorithms.":[73],"give":[75],"fixed-parameter":[77],"tractable":[78],"(FPT)":[79],"algorithm":[80,130],"running":[81],"time":[83],"$2^{\\mathcal{O}(k)}":[84],"n^{\\mathcal{O}(1)}$":[85],"deciding,":[86],"for":[87,110,131],"any":[88],"fixed":[89],"1$,":[92],"whether":[93],"all":[94,137],"can":[96],"be":[97],"hit":[98],"most":[101],"$k$":[102],"vertices.":[103],"This":[104],"generalizes":[105],"known":[106],"single-exponential":[107],"FPT":[108],"Vertex":[111,115],"Cover":[112],"Feedback":[114],"Set,":[116],"which":[117],"correspond":[118],"to":[119],"cases":[121],"$c=1,2$":[122],"respectively.":[123],"Finally,":[124],"we":[125],"present":[126],"an":[127],"$\\mathcal{O}(\\log":[128],"n)$-approximation":[129],"both":[132],"problems":[134],"smallest":[141],"number":[142,149],"maximum":[148],"vertex-disjoint":[151],"$c$-pumpkin-models.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2017-05-26T00:00:00"}