{"id":"https://openalex.org/W2041430500","doi":"https://doi.org/10.1137/s0895480193258716","title":"Packing Steiner Trees: Separation Algorithms","display_name":"Packing Steiner Trees: Separation Algorithms","publication_year":1996,"publication_date":"1996-05-01","ids":{"openalex":"https://openalex.org/W2041430500","doi":"https://doi.org/10.1137/s0895480193258716","mag":"2041430500"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480193258716","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480193258716","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":["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/A5057878065","display_name":"Martin Gr\u00f6tschel","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. Gr\u00f6tschel","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006197528","display_name":"Alexander Mart\u00edn","orcid":"https://orcid.org/0000-0001-7602-3653"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Martin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5029637448","display_name":"Robert Weismantel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Weismantel","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057878065"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0967,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.77343136,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"9","issue":"2","first_page":"233","last_page":"257"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9842000007629395,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8072054982185364},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7949288487434387},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7402447462081909},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.5116794109344482},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4815407395362854},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.47318363189697266},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45809489488601685},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.456147164106369},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4299159348011017},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.4111960828304291},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3116203546524048},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11424598097801208}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8072054982185364},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7949288487434387},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7402447462081909},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.5116794109344482},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4815407395362854},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.47318363189697266},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45809489488601685},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.456147164106369},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4299159348011017},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.4111960828304291},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3116203546524048},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11424598097801208},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0895480193258716","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480193258716","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:CiteSeerX.psu:10.1.1.45.1751","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.1751","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.zib.de/pub/zib-publications/reports/SC-93-02.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1970059532","https://openalex.org/W1971846459","https://openalex.org/W1974745840","https://openalex.org/W1979569488","https://openalex.org/W1986798241","https://openalex.org/W1996668544","https://openalex.org/W2000049725","https://openalex.org/W2014866491","https://openalex.org/W2022912747","https://openalex.org/W2080978495","https://openalex.org/W2082591111","https://openalex.org/W2148237104","https://openalex.org/W2150855695","https://openalex.org/W3127447045"],"related_works":["https://openalex.org/W3086542228","https://openalex.org/W2004288794","https://openalex.org/W4297786124","https://openalex.org/W1569731655","https://openalex.org/W4289540882","https://openalex.org/W4300128383","https://openalex.org/W2988186967","https://openalex.org/W2078047960","https://openalex.org/W2001139415","https://openalex.org/W2056155690"],"abstract_inverted_index":{"In":[0,86],"this":[1,87],"paper,":[2],"we":[3,89],"investigate":[4],"separation":[5,34,80,126],"problems":[6],"for":[7,12,36,55,82,102],"classes":[8],"of":[9,130,136,158,168],"inequalities":[10,39,113],"valid":[11],"the":[13,17,76,103,134,156,166],"polytope":[14],"associated":[15],"with":[16],"Steiner":[18,37],"tree":[19],"packing":[20],"problem,":[21],"a":[22,99,123,137,149,153,159],"problem":[23,35,81,140],"that":[24,47,58,141],"arises,":[25],"e.g.,":[26],"in":[27,43,52,61,92,144,152],"very":[28,124],"large-scale":[29],"integration":[30],"(VLSI)":[31],"routing.":[32,63],"The":[33],"partition":[38],"is":[40,133,142,161],"$\\mathcal{N":[41],"P}$-hard":[42],"general.":[44],"We":[45],"show":[46],"it":[48],"can":[49,90],"be":[50],"solved":[51],"polynomial":[53,93],"time":[54],"those":[56],"instances":[57],"come":[59],"up":[60],"switchbox":[62],"Our":[64],"algorithm":[65,132],"uses":[66],"dynamic":[67],"programming":[68],"techniques.":[69],"These":[70],"techniques":[71],"are":[72],"also":[73],"applied":[74],"to":[75,122],"much":[77],"more":[78],"complicated":[79],"alternating":[83,111],"cycle":[84,112],"inequalities.":[85],"case,":[88],"compute":[91],"time,":[94],"given":[95],"some":[96],"point":[97],"y,":[98],"lower":[100],"bound":[101],"gap":[104],"$\\alpha":[105],"-":[106],"a^T":[107],"y$":[108],"over":[109],"all":[110],"$a^T":[114],"x":[115],"\\geq":[116],"\\alpha":[117],"$.":[118],"This":[119],"gives":[120],"rise":[121],"effective":[125],"heuristic.":[127],"A":[128],"by-product":[129],"our":[131],"solution":[135],"combinatorial":[138],"optimization":[139],"interesting":[143],"its":[145,162,169],"own":[146],"right:":[147],"find":[148],"shortest":[150],"path":[151,160],"graph":[154],"where":[155],"\u201clength\u201d":[157],"usual":[163],"length":[164,167],"minus":[165],"longest":[170],"edge.":[171]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}