{"id":"https://openalex.org/W2071463666","doi":"https://doi.org/10.1051/ita:2001121","title":"On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem","display_name":"On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem","publication_year":2001,"publication_date":"2001-05-01","ids":{"openalex":"https://openalex.org/W2071463666","doi":"https://doi.org/10.1051/ita:2001121","mag":"2071463666"},"language":"en","primary_location":{"id":"doi:10.1051/ita:2001121","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita:2001121","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X","2804-7346"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","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/A5101610160","display_name":"Sounaka Mishra","orcid":null},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sounaka Mishra","raw_affiliation_strings":["Theoretical Statistics and Mathematics Unit, Indian Statistical Institute, Calcutta 700 035, India; e-mail: res9513@isical.ac.in"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Theoretical Statistics and Mathematics Unit, Indian Statistical Institute, Calcutta 700 035, India; e-mail: res9513@isical.ac.in","institution_ids":["https://openalex.org/I6498739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038105303","display_name":"Kripasindhu Sikdar","orcid":null},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kripasindhu Sikdar","raw_affiliation_strings":["Theoretical Statistics and Mathematics Unit, Indian Statistical Institute, Calcutta 700 035, India; e-mail: sikdar@isical.ac.in"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Theoretical Statistics and Mathematics Unit, Indian Statistical Institute, Calcutta 700 035, India; e-mail: sikdar@isical.ac.in","institution_ids":["https://openalex.org/I6498739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I6498739"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.18242185,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"35","issue":"3","first_page":"287","last_page":"309"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.9990000128746033,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.8238843679428101},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7770805358886719},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7320287227630615},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6453098058700562},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6364261507987976},{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.6166204810142517},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5865163803100586},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5352222919464111},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.5191275477409363},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4952506124973297},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4938271939754486},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4878711700439453},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4799083173274994},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4765377938747406},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41600269079208374},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.41324496269226074},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10022583603858948},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10020267963409424}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.8238843679428101},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7770805358886719},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7320287227630615},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6453098058700562},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6364261507987976},{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.6166204810142517},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5865163803100586},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5352222919464111},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.5191275477409363},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4952506124973297},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4938271939754486},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4878711700439453},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4799083173274994},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4765377938747406},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41600269079208374},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.41324496269226074},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10022583603858948},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10020267963409424},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"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.1051/ita:2001121","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita:2001121","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X","2804-7346"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W197939587","https://openalex.org/W1484841927","https://openalex.org/W1501644705","https://openalex.org/W1516959859","https://openalex.org/W1595563493","https://openalex.org/W1604147646","https://openalex.org/W1976422444","https://openalex.org/W1979519377","https://openalex.org/W1992170038","https://openalex.org/W2004237078","https://openalex.org/W2013215731","https://openalex.org/W2014221091","https://openalex.org/W2015101476","https://openalex.org/W2037637265","https://openalex.org/W2038225707","https://openalex.org/W2042649619","https://openalex.org/W2044531679","https://openalex.org/W2045560236","https://openalex.org/W2059453880","https://openalex.org/W2069169607","https://openalex.org/W2080076699","https://openalex.org/W2081254453","https://openalex.org/W2083271579","https://openalex.org/W2090487839","https://openalex.org/W2098361906","https://openalex.org/W2099103397","https://openalex.org/W2100308637","https://openalex.org/W2117158270","https://openalex.org/W2137560895","https://openalex.org/W2486715098","https://openalex.org/W2799004609","https://openalex.org/W3022694456","https://openalex.org/W4213214460","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2771742342","https://openalex.org/W2617667333","https://openalex.org/W2596574929","https://openalex.org/W2979387495","https://openalex.org/W4286984550","https://openalex.org/W4293700582","https://openalex.org/W1604147646","https://openalex.org/W2905241196","https://openalex.org/W4294702976","https://openalex.org/W2967929516"],"abstract_inverted_index":{"We":[0,45,121],"study":[1],"hardness":[2,78],"of":[3,54,66,75,79,83,125],"approximating":[4,80],"several":[5,128],"minimaximal":[6],"and":[7,56,127,136],"maximinimal":[8],"NP-optimization":[9],"problems":[10,130],"related":[11,129],"to":[12,21,58,97],"the":[13],"minimum":[14,24,61],"linear":[15],"ordering":[16],"problem":[17],"(MINLOP).":[18],"MINLOP":[19,34,55],"is":[20,35,41,51],"find":[22,59,98],"a":[23,29,52,60,67,84,99,106,110,118],"weight":[25],"acyclic":[26,64],"tournament":[27],"in":[28,105,117],"given":[30,68,107,119],"arc-weighted":[31],"complete":[32],"digraph.":[33],"APX-hard":[36],"but":[37],"its":[38],"unweighted":[39],"version":[40],"polynomial":[42],"time":[43],"solvable.":[44],"prove":[46,88,123],"that":[47],"MIN-MAX-SUBDAG":[48],"problem,":[49],"which":[50,95],"generalization":[53],"requires":[57,96],"cardinality":[62,101,112],"maximal":[63],"subdigraph":[65],"digraph,":[69],"is,":[70],"however,":[71],"APX-hard.":[72],"Using":[73],"results":[74,90],"H\u00e5stad":[76],"concerning":[77,91],"independence":[81],"number":[82],"graph":[85,108],"we":[86],"then":[87],"similar":[89],"MAX-MIN-VC":[92],"(respectively,":[93,109],"MAX-MIN-FVS)":[94],"maximum":[100,111],"minimal":[102,113],"vertex":[103,115],"cover":[104],"feedback":[114],"set":[116],"digraph).":[120],"also":[122],"APX-hardness":[124],"these":[126],"on":[131],"various":[132],"degree":[133],"bounded":[134],"graphs":[135],"digraphs.":[137]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}