{"id":"https://openalex.org/W1550086418","doi":"https://doi.org/10.1007/978-0-387-44641-7_32","title":"A Mimetic Algorithm for Refinement of Lower Bound of Number of Tracks in Channel Routing Problem","display_name":"A Mimetic Algorithm for Refinement of Lower Bound of Number of Tracks in Channel Routing Problem","publication_year":2007,"publication_date":"2007-11-13","ids":{"openalex":"https://openalex.org/W1550086418","doi":"https://doi.org/10.1007/978-0-387-44641-7_32","mag":"1550086418"},"language":"en","primary_location":{"id":"doi:10.1007/978-0-387-44641-7_32","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-44641-7_32","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-0-387-44641-7_32.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://link.springer.com/content/pdf/10.1007/978-0-387-44641-7_32.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101919576","display_name":"Debasri Saha","orcid":"https://orcid.org/0000-0002-7935-0980"},"institutions":[{"id":"https://openalex.org/I106542073","display_name":"University of Calcutta","ror":"https://ror.org/01e7v7w47","country_code":"IN","type":"education","lineage":["https://openalex.org/I106542073"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Debasri Saha","raw_affiliation_strings":["Department of Computer Science, University of Calcutta, Calcutta"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Calcutta, Calcutta","institution_ids":["https://openalex.org/I106542073"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037279956","display_name":"Rajat Kumar Pal","orcid":"https://orcid.org/0000-0001-9838-6500"},"institutions":[{"id":"https://openalex.org/I106542073","display_name":"University of Calcutta","ror":"https://ror.org/01e7v7w47","country_code":"IN","type":"education","lineage":["https://openalex.org/I106542073"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rajat K. Pal","raw_affiliation_strings":["Department of Computer Science, University of Calcutta, Calcutta"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Calcutta, Calcutta","institution_ids":["https://openalex.org/I106542073"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076315182","display_name":"Samar Sen Sarma","orcid":null},"institutions":[{"id":"https://openalex.org/I106542073","display_name":"University of Calcutta","ror":"https://ror.org/01e7v7w47","country_code":"IN","type":"education","lineage":["https://openalex.org/I106542073"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Samar Sen Sarma","raw_affiliation_strings":["Department of Computer Science, University of Calcutta, Calcutta"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Calcutta, Calcutta","institution_ids":["https://openalex.org/I106542073"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11640212,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"307","last_page":"316"},"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.9951000213623047,"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.9951000213623047,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9933000206947327,"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/T10142","display_name":"Formal Methods in Verification","score":0.9853000044822693,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.7117575407028198},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6392932534217834},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6088647842407227},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5993305444717407},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5671634674072266},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5547842383384705},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5515583753585815},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4915800988674164},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3678169846534729},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27731871604919434}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.7117575407028198},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6392932534217834},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6088647842407227},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5993305444717407},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5671634674072266},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5547842383384705},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5515583753585815},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4915800988674164},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3678169846534729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27731871604919434},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-0-387-44641-7_32","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-44641-7_32","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-0-387-44641-7_32.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/978-0-387-44641-7_32","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-44641-7_32","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-0-387-44641-7_32.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1550086418.pdf","grobid_xml":"https://content.openalex.org/works/W1550086418.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1487131898","https://openalex.org/W1512294245","https://openalex.org/W1523409994","https://openalex.org/W1751300721","https://openalex.org/W2143474538","https://openalex.org/W2320198223","https://openalex.org/W2746782519","https://openalex.org/W2799014154"],"related_works":["https://openalex.org/W2375684291","https://openalex.org/W2354676191","https://openalex.org/W2909957174","https://openalex.org/W3188646203","https://openalex.org/W136674370","https://openalex.org/W2105527480","https://openalex.org/W4320035781","https://openalex.org/W2052387497","https://openalex.org/W4246278799","https://openalex.org/W2050203848"],"abstract_inverted_index":{"Study":[0],"of":[1,20,26,47,54,66,72,80,102],"algorithms":[2],"and":[3,60,74],"its":[4],"design":[5],"can":[6,89],"be":[7],"progressed":[8],"in":[9,135],"various":[10],"dimensions.":[11],"In":[12],"this":[13,116],"paper,":[14],"we":[15],"have":[16],"a":[17,31,37],"definite":[18],"refinement":[19],"lower":[21,133],"bound":[22,134],"on":[23,84],"the":[24,55,62,81,95,99,103,131],"number":[25],"tracks":[27],"required":[28],"to":[29,43,97],"route":[30],"channel.":[32],"The":[33,49,119],"attack":[34],"is":[35],"from":[36],"complementary":[38],"viewpoint.":[39],"Our":[40],"algorithm":[41,82],"succeeds":[42],"avoid":[44],"all":[45],"kind":[46],"approximation.":[48],"approach":[50,88],"performs":[51],"exact":[52],"mapping":[53],"problem":[56],"into":[57],"graphical":[58,100],"presentation":[59,101],"analyzes":[61],"graph":[63],"taking":[64],"help":[65],"mimetic":[67,87],"algorithm,":[68],"which":[69,125],"uses":[70],"combination":[71],"sequential":[73],"GA":[75],"based":[76],"vertex":[77],"coloring.":[78],"Performance":[79],"depends":[83],"how":[85],"effectively":[86],"applied":[90],"selecting":[91],"appropriate":[92],"values":[93],"for":[94,115],"parameters":[96],"evaluate":[98],"problem.":[104,118,139],"This":[105],"viewpoint":[106],"has":[107],"immense":[108],"contribution":[109],"against":[110],"sticking":[111],"at":[112,129],"local":[113],"minima":[114],"optimization":[117],"finer":[120],"result":[121],"clearly":[122],"exemplifies":[123],"instances,":[124],"give":[126],"better":[127],"or":[128],"least":[130],"same":[132],"VLSI":[136],"channel":[137],"routing":[138]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}