{"id":"https://openalex.org/W1504306194","doi":null,"title":"Combinatorial algorithms for optimization problems","display_name":"Combinatorial algorithms for optimization problems","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W1504306194","mag":"1504306194"},"language":"en","primary_location":{"id":"pmh:ADA254553","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA254553","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"},"volume":null,"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/A5026385549","display_name":"Edith Cohen","orcid":"https://orcid.org/0000-0002-3926-8237","observed_orcids":["https://orcid.org/0000-0002-3926-8237"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Edith Cohen","raw_affiliation_strings":["Stanford University Stanford CA"],"raw_orcid":"https://orcid.org/0000-0002-3926-8237","affiliations":[{"raw_affiliation_string":"Stanford University Stanford CA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5026385549"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":1.7814,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.8209011,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/strongly-polynomial-algorithms","display_name":"strongly polynomial algorithms","score":0.7919999957084656},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.7350000143051147},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9049999713897705},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.9350000023841858},{"id":"https://openalex.org/keywords/cycle-detection","display_name":"cycle detection","score":0.5490000247955322},{"id":"https://openalex.org/keywords/periodic-graphs","display_name":"periodic graphs","score":0.984000027179718},{"id":"https://openalex.org/keywords/parametric-linear-programming","display_name":"parametric linear programming","score":0.7720000147819519},{"id":"https://openalex.org/keywords/network-flow-problems","display_name":"network flow problems","score":0.7919999957084656},{"id":"https://openalex.org/keywords/sequential-algorithms","display_name":"sequential algorithms","score":0.3840000033378601}],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5623438358306885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5614306330680847},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5363219380378723},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5222188234329224},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.519811749458313},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.4495667815208435},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4155787229537964},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.3564707636833191},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33140432834625244},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.158378005027771},{"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":"pmh:ADA254553","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA254553","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"},{"id":"mag:1504306194","doi":null,"is_oa":false,"landing_page_url":"http://ci.nii.ac.jp/ncid/BA2235949X?l=ja","pdf_url":null,"source":{"id":"https://openalex.org/S4306480125","display_name":"Stanford University eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310316103","host_organization_name":"Stanford University","host_organization_lineage":["https://openalex.org/P4310316103"],"host_organization_lineage_names":["Stanford University"],"type":"ebook platform"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Stanford University eBooks","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1966971203","https://openalex.org/W1973117121","https://openalex.org/W1979641885","https://openalex.org/W2035144082","https://openalex.org/W2090286414","https://openalex.org/W2103985627","https://openalex.org/W2150154671","https://openalex.org/W2156036190"],"related_works":["https://openalex.org/W7098092116","https://openalex.org/W2026261955","https://openalex.org/W2576511634","https://openalex.org/W1982775314","https://openalex.org/W3137940023","https://openalex.org/W1979962503","https://openalex.org/W3088569426","https://openalex.org/W3153235645","https://openalex.org/W1526562410","https://openalex.org/W7135968709"],"abstract_inverted_index":{"Linear":[0],"programming":[1,27,44,92],"is":[2,33,47,66,128,164],"a":[3,104,132,137],"very":[4],"general":[5,42,64,90,208],"and":[6,80,93,136,188],"widely":[7],"used":[8,129],"framework.":[9],"In":[10,58],"this":[11],"thesis":[12],"we":[13],"consider":[14],"several":[15],"combinatorial":[16],"optimization":[17],"problems":[18,28,70,111,158],"that":[19,35,62,83,106],"can":[20],"be":[21,121],"viewed":[22],"as":[23],"classes":[24,109],"of":[25,53,110,147,157,162,192],"linear":[26,43,91,172],"with":[29,71,199],"special":[30,72],"structure.":[31],"It":[32,46],"known":[34,88,112,119],"polynomial":[36,98,116,139],"time":[37],"algorithms":[38,82,99,169,183,205],"exist":[39],"for":[40,89,141,170,206],"the":[41,63,108,160,186],"problem.":[45],"not":[48],"known,":[49],"however,":[50],"whether":[51,96],"any":[52],"them":[54],"are":[55,76,84,197],"strongly":[56,97,115,138],"polynomial.":[57],"addition,":[59],"it":[60],"seems":[61],"problem":[65],"inherently":[67],"sequential.":[68],"For":[69],"structure,":[73],"our":[74],"goals":[75],"to":[77,94,113,120,130,154,202],"develop":[78,103],"sequential":[79,187],"parallel":[81,134,189],"faster":[85,204],"than":[86],"those":[87],"determine":[95],"exist.":[100],"(1)":[101],"We":[102,150,167],"technique":[105,127],"extends":[107],"have":[114],"algorithms,":[117],"or":[118],"quickly":[122],"solvable":[123],"in":[124,144],"parallel.":[125],"This":[126],"obtain":[131],"fast":[133],"algorithm":[135,140],"detecting":[142],"cycles":[143],"periodic":[145],"graphs":[146],"fixed":[148],"dimension.":[149],"mention":[151],"additional":[152,200],"applications":[153],"parametric":[155],"extensions":[156],"where":[159,174],"number":[161],"parameters":[163],"fixed.":[165],"(2)":[166],"introduce":[168],"solving":[171],"systems":[173],"each":[175],"inequality":[176],"involves":[177],"at":[178],"most":[179],"two":[180],"variables.":[181],"These":[182,195],"improve":[184],"over":[185],"running":[190],"times":[191],"previous":[193],"algorithms.":[194],"results":[196],"combined":[198],"ideas":[201],"yield":[203],"some":[207],"network":[209],"flow":[210],"problems.":[211]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2016-06-24T00:00:00"}