{"id":"https://openalex.org/W2000037876","doi":"https://doi.org/10.1142/s0218213097000141","title":"TCGD: A Time-Constrained Approximate Guided Depth-First Search Algorithm","display_name":"TCGD: A Time-Constrained Approximate Guided Depth-First Search Algorithm","publication_year":1997,"publication_date":"1997-06-01","ids":{"openalex":"https://openalex.org/W2000037876","doi":"https://doi.org/10.1142/s0218213097000141","mag":"2000037876"},"language":"en","primary_location":{"id":"doi:10.1142/s0218213097000141","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213097000141","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","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/A5080392568","display_name":"Benjamin W. Wah","orcid":"https://orcid.org/0000-0002-2335-3904"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin W. Wah","raw_affiliation_strings":["Department of Electrical and Computer Engineering and the Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL 61801, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and the Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL 61801, U.S.A","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109157766","display_name":"Lon-Chan Chu","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lon-Chan Chu","raw_affiliation_strings":["Microsoft Corporation, Redmond, WA 98052, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Corporation, Redmond, WA 98052, U.S.A","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.12464453,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"06","issue":"02","first_page":"255","last_page":"271"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.989300012588501,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9574000239372253,"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/computer-science","display_name":"Computer science","score":0.6837862133979797},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6558088660240173},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.538456380367279},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5168795585632324},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49387556314468384},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.48952731490135193},{"id":"https://openalex.org/keywords/combinatorial-search","display_name":"Combinatorial search","score":0.4864954352378845},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.4709796905517578},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4469279646873474},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43082353472709656},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.41181480884552},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.38438665866851807},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26463794708251953},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.2191745638847351},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09140977263450623}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6837862133979797},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6558088660240173},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.538456380367279},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5168795585632324},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49387556314468384},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.48952731490135193},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.4864954352378845},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.4709796905517578},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4469279646873474},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43082353472709656},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.41181480884552},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.38438665866851807},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26463794708251953},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.2191745638847351},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09140977263450623},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0218213097000141","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213097000141","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.41.1384","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.1384","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://manip.crhc.uiuc.edu/~wah/Wah/papers/Dirs/J56/J56.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2376570066","https://openalex.org/W3098335909","https://openalex.org/W2120609036","https://openalex.org/W2354057059","https://openalex.org/W2208339373","https://openalex.org/W3014882394","https://openalex.org/W2064794194","https://openalex.org/W2008047931","https://openalex.org/W4214503203","https://openalex.org/W2593395660"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,58,76],"develop":[4],"TCGD,":[5],"a":[6,27],"problem-independent,":[7],"time-constrained,":[8],"approximate":[9],"guided":[10],"depth-first":[11],"search":[12,37],"(GDFS)":[13],"algorithm.":[14],"The":[15,74],"algorithm":[16],"is":[17],"designed":[18],"to":[19],"achieve":[20],"the":[21,55,61,83],"best":[22],"ascertained":[23],"approximation":[24,67],"degree":[25,68],"under":[26],"fixed":[28],"time":[29,63],"constraint.":[30],"We":[31,43],"consider":[32],"only":[33],"searches":[34],"with":[35,49],"finite":[36],"space":[38],"and":[39],"admissible":[40],"heuristic":[41],"functions.":[42],"study":[44,77],"NP-hard":[45],"combinatorial":[46],"optimization":[47],"problems":[48,56],"polynomial-time":[50],"computable":[51],"feasible":[52],"solutions.":[53],"For":[54],"studied,":[57],"observe":[59],"that":[60],"execution":[62],"increases":[64],"exponentially":[65],"as":[66],"decreases,":[69],"although":[70],"anomalies":[71],"may":[72],"happen.":[73],"algorithms":[75],"are":[78],"evaluated":[79],"by":[80],"simulations":[81],"using":[82],"symmetric":[84],"traveling-salesperson":[85],"problem.":[86]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}