{"id":"https://openalex.org/W1916472382","doi":"https://doi.org/10.37236/449","title":"Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs","display_name":"Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs","publication_year":2010,"publication_date":"2010-12-10","ids":{"openalex":"https://openalex.org/W1916472382","doi":"https://doi.org/10.37236/449","mag":"1916472382"},"language":"en","primary_location":{"id":"doi:10.37236/449","is_oa":true,"landing_page_url":"https://doi.org/10.37236/449","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v17i1r177/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v17i1r177/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009575159","display_name":"William Duckworth","orcid":null},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"W. Duckworth","raw_affiliation_strings":["Australian National University"],"affiliations":[{"raw_affiliation_string":"Australian National University","institution_ids":["https://openalex.org/I118347636"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114010170","display_name":"N. C. Wormald","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"N. Wormald","raw_affiliation_strings":["(University of Waterloo)"],"affiliations":[{"raw_affiliation_string":"(University of Waterloo)","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009575159"],"corresponding_institution_ids":["https://openalex.org/I118347636"],"apc_list":null,"apc_paid":null,"fwci":0.6836,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.69040133,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"17","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/combinatorics","display_name":"Combinatorics","score":0.7697564959526062},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6813177466392517},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5711488723754883},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5668471455574036},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4994192123413086},{"id":"https://openalex.org/keywords/cubic-graph","display_name":"Cubic graph","score":0.4628431499004364},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.452603280544281},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4477430284023285},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42908382415771484},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32717856764793396},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.315512478351593},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2748561501502991},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19720685482025146},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.17395812273025513},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17005795240402222},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.13495862483978271}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7697564959526062},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6813177466392517},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5711488723754883},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5668471455574036},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4994192123413086},{"id":"https://openalex.org/C100500283","wikidata":"https://www.wikidata.org/wiki/Q1374495","display_name":"Cubic graph","level":5,"score":0.4628431499004364},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.452603280544281},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4477430284023285},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42908382415771484},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32717856764793396},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.315512478351593},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2748561501502991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19720685482025146},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.17395812273025513},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17005795240402222},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13495862483978271},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.37236/449","is_oa":true,"landing_page_url":"https://doi.org/10.37236/449","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v17i1r177/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.115.7175","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.7175","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uwaterloo.ca/~nwormald/papers/LP.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.22.5317","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.5317","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ms.unimelb.edu.au/~nick/papers/LPworst.pdf","raw_type":"text"},{"id":"pmh:oai:openresearch-repository.anu.edu.au:1885/66400","is_oa":false,"landing_page_url":"http://hdl.handle.net/1885/66400","pdf_url":null,"source":{"id":"https://openalex.org/S4306402539","display_name":"ANU Open Research (Australian National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118347636","host_organization_name":"Australian National University","host_organization_lineage":["https://openalex.org/I118347636"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Electronic Journal of Combinatorics","raw_type":"Journal article"}],"best_oa_location":{"id":"doi:10.37236/449","is_oa":true,"landing_page_url":"https://doi.org/10.37236/449","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v17i1r177/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5714184577","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G919846122","display_name":null,"funder_award_id":"Chair","funder_id":"https://openalex.org/F4320320994","funder_display_name":"Canada Research Chairs"}],"funders":[{"id":"https://openalex.org/F4320320591","display_name":"Macquarie University","ror":"https://ror.org/01sf06y89"},{"id":"https://openalex.org/F4320320974","display_name":"University of Melbourne","ror":"https://ror.org/01ej9dk98"},{"id":"https://openalex.org/F4320320994","display_name":"Canada Research Chairs","ror":"https://ror.org/0517h6h17"},{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1916472382.pdf","grobid_xml":"https://content.openalex.org/works/W1916472382.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W1523650025","https://openalex.org/W1553492721","https://openalex.org/W1653539840","https://openalex.org/W1728611673","https://openalex.org/W1963547452","https://openalex.org/W1964543450","https://openalex.org/W1974110893","https://openalex.org/W1974199390","https://openalex.org/W1976422444","https://openalex.org/W1988133548","https://openalex.org/W1993589418","https://openalex.org/W2008704324","https://openalex.org/W2009986724","https://openalex.org/W2011039300","https://openalex.org/W2014959271","https://openalex.org/W2015698277","https://openalex.org/W2034107473","https://openalex.org/W2035040468","https://openalex.org/W2037318072","https://openalex.org/W2048653445","https://openalex.org/W2083165612","https://openalex.org/W2089315616","https://openalex.org/W2091166220","https://openalex.org/W2097260844","https://openalex.org/W2112825968","https://openalex.org/W2113930605","https://openalex.org/W2127967904","https://openalex.org/W2130665104","https://openalex.org/W2134003300","https://openalex.org/W2137560895","https://openalex.org/W2153219831","https://openalex.org/W2174383848","https://openalex.org/W2221843896","https://openalex.org/W2476096155","https://openalex.org/W2683519875","https://openalex.org/W2987732947","https://openalex.org/W4243833241","https://openalex.org/W4285719527","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W4283803822","https://openalex.org/W2029336174","https://openalex.org/W2963009577","https://openalex.org/W2063494850","https://openalex.org/W2788975631","https://openalex.org/W2903402681","https://openalex.org/W3199257895","https://openalex.org/W1994963913","https://openalex.org/W123842721","https://openalex.org/W4226153102"],"abstract_inverted_index":{"We":[0,29,64,86,140],"introduce":[1],"a":[2,17,43,48,55,83,103,128,181],"technique":[3,35],"using":[4],"linear":[5],"programming":[6],"that":[7,66,89,158],"may":[8],"be":[9],"used":[10],"to":[11,127,135],"analyse":[12],"the":[13,31,40,72,90,100,159,168,178],"worst-case":[14],"performance":[15],"of":[16,19,33,42,74,92,102,147,161,170,180],"class":[18],"greedy":[20],"heuristics":[21,37],"for":[22,38,67,153],"certain":[23],"optimisation":[24],"problems":[25,137],"on":[26,36],"regular":[27],"graphs.":[28,63],"demonstrate":[30],"use":[32],"this":[34],"bounding":[39],"size":[41,73,91,101,160,169,179],"minimum":[44,49,56],"maximal":[45],"matching":[46],"(MMM),":[47],"connected":[50,69,144],"dominating":[51,58],"set":[52,59],"(MCDS)":[53],"and":[54,99,132,152,177],"independent":[57],"(MIDS)":[60],"in":[61],"cubic":[62,70,145],"show":[65,88,157],"$n$-vertex":[68,143],"graphs,":[71],"an":[75,93,162,171],"MMM":[76,163],"is":[77,82,95,105,126,164,173,183],"at":[78,96,106,149,165,174,184],"most":[79,97,107,166,175,185],"$9n/20+O(1)$,":[80],"which":[81],"new":[84],"result.":[85],"also":[87,141],"MCDS":[94,172],"$3n/4+O(1)$":[98],"MIDS":[104,182],"$29n/70+O(1)$.":[108],"These":[109],"results":[110],"are":[111],"not":[112],"new,":[113],"but":[114],"earlier":[115],"proofs":[116],"involved":[117],"rather":[118],"long":[119],"ad-hoc":[120],"arguments.":[121],"By":[122],"contrast,":[123],"our":[124],"method":[125],"large":[129],"extent":[130],"automatic":[131],"can":[133],"apply":[134],"other":[136],"as":[138],"well.":[139],"consider":[142],"graphs":[146,155],"girth":[148],"least":[150],"5":[151],"such":[154],"we":[156],"$3n/7+O(1)$,":[167],"$2n/3+O(1)$":[176],"$3n/8+O(1)$.":[186]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}