{"id":"https://openalex.org/W66396247","doi":null,"title":"WORST-CASE RELATIVE PERFORMANCES OF HEURISTICS FOR THE STEINER PROBLEM IN GRAPHS","display_name":"WORST-CASE RELATIVE PERFORMANCES OF HEURISTICS FOR THE STEINER PROBLEM IN GRAPHS","alternate_titles":[],"publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W66396247","mag":"66396247"},"language":"en","primary_location":{"id":"mag:66396247","doi":null,"is_oa":false,"landing_page_url":"http://emis.maths.adelaide.edu.au/journals/AMUC/_vol-60/_no_2/_plesnik/plesnik.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W66396247"],"child_works_count":0,"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/A5110158773","display_name":"J\u00e1n Plesn\u00edk","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"J\u00e1n Plesn\u0131\u0301k","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5110158773"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2664,"has_fulltext":false,"cited_by_count":19,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.7391683,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":96},"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.9965999722480774,"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.9965999722480774,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.0008999999845400453,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.000699999975040555,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.6259999871253967},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5920000076293945},{"id":"https://openalex.org/keywords/network-design","display_name":"network design","score":0.4560000002384186},{"id":"https://openalex.org/keywords/heuristics","display_name":"heuristics","score":0.6320000290870667}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8380485773086548},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8228974342346191},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5875717401504517},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5763633847236633},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5318548083305359},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4731610417366028},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4722197353839874},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.46862557530403137},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4253637194633484},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42239969968795776},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3471764922142029},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11413291096687317}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:66396247","doi":null,"is_oa":false,"landing_page_url":"http://emis.maths.adelaide.edu.au/journals/AMUC/_vol-60/_no_2/_plesnik/plesnik.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.26.9096","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.9096","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.emis.de/journals/AMUC/_vol-60/_no_2/_plesnik/plesnik.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1889632490","https://openalex.org/W1975290397","https://openalex.org/W2042492403","https://openalex.org/W2063395464","https://openalex.org/W2068362339","https://openalex.org/W2070664846","https://openalex.org/W2082150701","https://openalex.org/W2087598714","https://openalex.org/W2115036101","https://openalex.org/W2117937654","https://openalex.org/W2128865241","https://openalex.org/W2172222998","https://openalex.org/W2175892715","https://openalex.org/W2586554544","https://openalex.org/W3127447045"],"related_works":["https://openalex.org/W7099783711","https://openalex.org/W2016939258","https://openalex.org/W163762979","https://openalex.org/W991545591","https://openalex.org/W1970669216","https://openalex.org/W2175386845","https://openalex.org/W2172222998","https://openalex.org/W2079798601","https://openalex.org/W2011065039","https://openalex.org/W2334819359"],"abstract_inverted_index":{".":[0,100],"The":[1],"Steiner":[2,64,155],"problem":[3,65],"asks":[4],"for":[5],"a":[6,11,17,72,84,106,170,185],"minimum":[7,107],"cost":[8,86,108,117],"tree":[9,109],"spanning":[10,113],"given":[12,71],"subset":[13],"of":[14,43,118,126,158],"vertices":[15],"in":[16,66,164],"graph":[18,73],"(network)":[19],"with":[20],"positive":[21],"edge":[22,128],"costs.":[23,129],"First":[24],"we":[25,69],"modify":[26],"the":[27,41,63,116,124,143,165,174],"Rayward-Smith":[28],"heuristic":[29],"and":[30,77,96,138,180],"prove":[31],"that":[32],"this":[33,154],"does":[34],"not":[35],"change":[36],"its":[37,127],"worst-case":[38,57],"performance,":[39],"but":[40],"number":[42],"iterations":[44],"is":[45,123],"often":[46],"reduced.":[47],"Then":[48],"9":[49],"heuristics":[50],"are":[51,70,102,147,160],"theoretically":[52],"analysed":[53],"as":[54],"to":[55,104,153],"their":[56],"relative":[58],"performances.":[59],"1.":[60],"Introduction":[61],"In":[62],"graphs":[67],"(networks)":[68],"(undirected,":[74],"without":[75],"loops":[76],"multiple":[78],"edges)":[79],"G":[80,112],"=":[81],"(V;":[82],"E),":[83],"positive-valued":[85],"(length)":[87],"function":[88],"c":[89],":":[90],"E":[91],"!":[92],"R":[93],"+":[94],",":[95,120],"Z":[97],"`":[98,111],"V":[99],"We":[101],"asked":[103],"find":[105],"T":[110,119],"Z,":[114],"where":[115],"c(T":[121],"),":[122],"sum":[125],"Denote":[130],"n":[131],":=":[132,136,140],"jV":[133],"j,":[134],"m":[135],"jEj":[137],"p":[139],"jZj.":[141],"At":[142],"present":[144],"time":[145],"there":[146],"more":[148],"than":[149],"100":[150],"papers":[151],"related":[152],"problem.":[156],"Most":[157],"them":[159],"surveyed":[161],"by":[162,178],"Winter":[163],"excellent":[166],"paper":[167],"[19].":[168],"For":[169],"further":[171],"work":[172],"see":[173],"very":[175],"recent":[176],"survey":[177],"Hwang":[179],"Richards":[181],"[7]":[182],"which":[183],"gives":[184],"vast":[186],"bibli...":[187]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W66396247","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
