{"id":"https://openalex.org/W2069365089","doi":"https://doi.org/10.15439/2014f50","title":"Exact and Approximation Algorithms for Linear Arrangement Problems","display_name":"Exact and Approximation Algorithms for Linear Arrangement Problems","publication_year":2014,"publication_date":"2014-09-29","ids":{"openalex":"https://openalex.org/W2069365089","doi":"https://doi.org/10.15439/2014f50","mag":"2069365089"},"language":"en","primary_location":{"id":"doi:10.15439/2014f50","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2014f50","pdf_url":"https://annals-csis.org/proceedings/2014/pliks/50.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://annals-csis.org/proceedings/2014/pliks/50.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5097509029","display_name":"Alain Quiliot","orcid":null},"institutions":[{"id":"https://openalex.org/I198244214","display_name":"Universit\u00e9 Clermont Auvergne","ror":"https://ror.org/01a8ajp46","country_code":"FR","type":"education","lineage":["https://openalex.org/I198244214"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Alain Quiliot","raw_affiliation_strings":["LIMOS CNRS UMR 6158, LABEX IMOBS3, Universit\u00e9 Blaise Pascal, Bat ISIMA, BP 10125, Campus des C\u00e9zaux, 63173 Aubi\u00e8re, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIMOS CNRS UMR 6158, LABEX IMOBS3, Universit\u00e9 Blaise Pascal, Bat ISIMA, BP 10125, Campus des C\u00e9zaux, 63173 Aubi\u00e8re, France","institution_ids":["https://openalex.org/I198244214","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032025171","display_name":"Djamal Reba\u00efne","orcid":"https://orcid.org/0000-0002-6076-4032"},"institutions":[{"id":"https://openalex.org/I104914703","display_name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Chicoutimi","ror":"https://ror.org/00y3hzd62","country_code":"CA","type":"education","lineage":["https://openalex.org/I104914703","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Djamal Rebaine","raw_affiliation_strings":["UQAC, D\u00e9partement d'Informatique, Chicoutimi, Saguenay, Quebec, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UQAC, D\u00e9partement d'Informatique, Chicoutimi, Saguenay, Quebec, Canada","institution_ids":["https://openalex.org/I104914703"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5097509029"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I198244214"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06268657,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"493","last_page":"500"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9986000061035156,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.6165280342102051},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.6126030087471008},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5923610329627991},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5624947547912598},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5455918908119202},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48362651467323303},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4432118535041809},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4382554590702057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41821256279945374},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4088950753211975},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3830057978630066}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6165280342102051},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6126030087471008},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5923610329627991},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5624947547912598},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5455918908119202},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48362651467323303},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4432118535041809},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4382554590702057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41821256279945374},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4088950753211975},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3830057978630066},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.15439/2014f50","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2014f50","pdf_url":"https://annals-csis.org/proceedings/2014/pliks/50.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:doaj.org/article:e544869e200a487e9cb8c59ec1e26d40","is_oa":false,"landing_page_url":"https://doaj.org/article/e544869e200a487e9cb8c59ec1e26d40","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"Annals of computer science and information systems, Vol 2, Pp 493-500 (2014)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.15439/2014f50","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2014f50","pdf_url":"https://annals-csis.org/proceedings/2014/pliks/50.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2069365089.pdf","grobid_xml":"https://content.openalex.org/works/W2069365089.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1502167149","https://openalex.org/W1592022163","https://openalex.org/W1972789308","https://openalex.org/W1999214321","https://openalex.org/W2011039300","https://openalex.org/W2012605254","https://openalex.org/W2037583329","https://openalex.org/W2040355785"],"related_works":["https://openalex.org/W1931020284","https://openalex.org/W2389899617","https://openalex.org/W1591098987","https://openalex.org/W4319942994","https://openalex.org/W2398738602","https://openalex.org/W4394849239","https://openalex.org/W2965171438","https://openalex.org/W2962917430","https://openalex.org/W2182290077","https://openalex.org/W2028468530"],"abstract_inverted_index":{"We":[0,13],"present":[1],"here":[2],"new":[3,17],"results":[4],"and":[5,28,65],"algorithms":[6],"for":[7,39,61,73],"the":[8,24,40,47],"Linear":[9],"Arrangement":[10],"Problem":[11],"(LAP).":[12],"first":[14,53],"propose":[15],"a":[16,30,36],"lower":[18,57],"bound,":[19],"which":[20],"links":[21],"LAP":[22],"with":[23],"Max":[25],"Cut":[26],"Problem,":[27],"derive":[29,66],"LIP":[31],"model":[32],"as":[33,35],"well":[34],"branch/bound":[37],"algorithm":[38,72],"general":[41,74],"case.":[42],"Then":[43],"we":[44,52],"focus":[45],"on":[46],"case":[48],"of":[49],"interval":[50,63,75],"graphs:":[51],"show":[54],"that":[55],"our":[56],"bound":[58],"is":[59],"tight":[60],"unit":[62],"graphs,":[64],"an":[67],"efficient":[68],"polynomial":[69],"time":[70],"approximation":[71],"graphs.":[76]},"counts_by_year":[],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}