{"id":"https://openalex.org/W2003360411","doi":"https://doi.org/10.1080/03057920412331272126","title":"Computing near-optimal solutions for the dominating subset with minimal weight problem","display_name":"Computing near-optimal solutions for the dominating subset with minimal weight problem","publication_year":2004,"publication_date":"2004-11-01","ids":{"openalex":"https://openalex.org/W2003360411","doi":"https://doi.org/10.1080/03057920412331272126","mag":"2003360411"},"language":"en","primary_location":{"id":"doi:10.1080/03057920412331272126","is_oa":false,"landing_page_url":"https://doi.org/10.1080/03057920412331272126","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer 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/A5053036517","display_name":"Urfat Nur\u0131yev","orcid":"https://orcid.org/0000-0002-3337-5859"},"institutions":[{"id":"https://openalex.org/I4210153001","display_name":"North-West State Technical University","ror":"https://ror.org/04dm8yx03","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210153001"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Nuriyev Urfat","raw_affiliation_strings":["Correspondenceurfat@sci.ege.edu.tr"],"affiliations":[{"raw_affiliation_string":"Correspondenceurfat@sci.ege.edu.tr","institution_ids":["https://openalex.org/I4210153001"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5097144118","display_name":"Ordin Burak \u2020","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ordin Burak \u2020","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053036517"],"corresponding_institution_ids":["https://openalex.org/I4210153001"],"apc_list":null,"apc_paid":null,"fwci":0.3371,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.59000852,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"81","issue":"11","first_page":"1309","last_page":"1318"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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.9993000030517578,"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.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7790116667747498},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5476540327072144},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5295772552490234},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.456545352935791},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4406887888908386},{"id":"https://openalex.org/keywords/associative-property","display_name":"Associative property","score":0.4238855838775635},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4184274673461914},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.41544878482818604},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.4131057858467102},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2865169048309326},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.06316247582435608}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7790116667747498},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5476540327072144},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5295772552490234},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.456545352935791},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4406887888908386},{"id":"https://openalex.org/C159423971","wikidata":"https://www.wikidata.org/wiki/Q177251","display_name":"Associative property","level":2,"score":0.4238855838775635},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4184274673461914},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.41544878482818604},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.4131057858467102},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2865169048309326},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.06316247582435608},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/03057920412331272126","is_oa":false,"landing_page_url":"https://doi.org/10.1080/03057920412331272126","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W179151509","https://openalex.org/W615848585","https://openalex.org/W2004572490","https://openalex.org/W2157054705","https://openalex.org/W2314417323","https://openalex.org/W3158532942"],"related_works":["https://openalex.org/W3092222000","https://openalex.org/W2359932338","https://openalex.org/W2474680198","https://openalex.org/W2187607209","https://openalex.org/W1586515950","https://openalex.org/W2361668362","https://openalex.org/W146489555","https://openalex.org/W1223758158","https://openalex.org/W2089077065","https://openalex.org/W2136145311"],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"we":[3,52],"consider":[4],"a":[5,29,54,59],"combinatorial":[6],"\u201cdominating":[7],"subset":[8],"with":[9],"minimal":[10],"weight\u201d":[11],"problem,":[12],"which":[13,57],"is":[14],"an":[15],"associative":[16],"problem":[17,24,43,72],"for":[18,69],"solving":[19,70],"global":[20],"optimization":[21],"problem.":[22,33],"This":[23],"can":[25],"be":[26],"expressed":[27],"as":[28],"kind":[30],"of":[31,41,77],"assignment":[32],"The":[34],"mathematical":[35],"model":[36],"and":[37,46,73],"the":[38,42,71,75],"economical":[39],"interpretations":[40],"are":[44,49],"given":[45],"its":[47],"properties":[48,68],"described.":[50],"Then,":[51],"propose":[53],"new":[55],"algorithm":[56],"has":[58],"ratio":[60],"bound":[61],"in":[62],"polynomial":[63],"time,":[64],"by":[65],"using":[66],"above":[67],"present":[74],"results":[76],"numerical":[78],"experiments.":[79]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}