{"id":"https://openalex.org/W1999021745","doi":"https://doi.org/10.1080/15427951.2006.10129126","title":"Cuts and Disjoint Paths in the Valley-Free Path Model","display_name":"Cuts and Disjoint Paths in the Valley-Free Path Model","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1999021745","doi":"https://doi.org/10.1080/15427951.2006.10129126","mag":"1999021745"},"language":"en","primary_location":{"id":"doi:10.1080/15427951.2006.10129126","is_oa":true,"landing_page_url":"https://doi.org/10.1080/15427951.2006.10129126","pdf_url":"https://www.internetmathematicsjournal.com/article/1422.pdf","source":{"id":"https://openalex.org/S19474917","display_name":"Internet Mathematics","issn_l":"1542-7951","issn":["1542-7951","1944-9488"],"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":"Internet Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.internetmathematicsjournal.com/article/1422.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049579750","display_name":"Thomas Erlebach","orcid":"https://orcid.org/0000-0002-4470-5868"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Thomas Erlebach","raw_affiliation_strings":["University of Leicester"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Leicester","institution_ids":["https://openalex.org/I153648349"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003829918","display_name":"Alexander Hall","orcid":"https://orcid.org/0000-0002-5866-2221"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander Hall","raw_affiliation_strings":["University of California at Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063633119","display_name":"Alessandro Panconesi","orcid":"https://orcid.org/0000-0002-2169-3067"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alessandro Panconesi","raw_affiliation_strings":["Sapienza, university of Rome"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sapienza, university of Rome","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":null,"display_name":"Danica Vukadinovi\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Danica Vukadinovi\u0107","raw_affiliation_strings":["[ETH, Zurich]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[ETH, Zurich]","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.623,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.72004977,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3","issue":"3","first_page":"333","last_page":"359"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9980999827384949,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9980999827384949,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9973999857902527,"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.996999979019165,"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/mathematics","display_name":"Mathematics","score":0.8162966966629028},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6765025854110718},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6640730500221252},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6468088626861572},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6113513708114624},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5609754920005798},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.556515634059906},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.4719982147216797},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.46397003531455994},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4538090229034424},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43635252118110657},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41959571838378906},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.3361186683177948},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.18163305521011353},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08830282092094421}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8162966966629028},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6765025854110718},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6640730500221252},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6468088626861572},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6113513708114624},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5609754920005798},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.556515634059906},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.4719982147216797},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.46397003531455994},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4538090229034424},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43635252118110657},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41959571838378906},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3361186683177948},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.18163305521011353},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08830282092094421},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1080/15427951.2006.10129126","is_oa":true,"landing_page_url":"https://doi.org/10.1080/15427951.2006.10129126","pdf_url":"https://www.internetmathematicsjournal.com/article/1422.pdf","source":{"id":"https://openalex.org/S19474917","display_name":"Internet Mathematics","issn_l":"1542-7951","issn":["1542-7951","1944-9488"],"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":"Internet Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.im/1204906161","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.im/1204906161","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:iris.uniroma1.it:11573/44662","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/44662","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1080/15427951.2006.10129126","is_oa":true,"landing_page_url":"https://doi.org/10.1080/15427951.2006.10129126","pdf_url":"https://www.internetmathematicsjournal.com/article/1422.pdf","source":{"id":"https://openalex.org/S19474917","display_name":"Internet Mathematics","issn_l":"1542-7951","issn":["1542-7951","1944-9488"],"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":"Internet Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6281229250","display_name":null,"funder_award_id":"001907","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321942","display_name":"Hasler Stiftung","ror":"https://ror.org/04m3t9183"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1999021745.pdf","grobid_xml":"https://content.openalex.org/works/W1999021745.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W65584354","https://openalex.org/W90432960","https://openalex.org/W1505819794","https://openalex.org/W1523006294","https://openalex.org/W1561258167","https://openalex.org/W1580189352","https://openalex.org/W1595451540","https://openalex.org/W1977545325","https://openalex.org/W1987592554","https://openalex.org/W2011039300","https://openalex.org/W2011824721","https://openalex.org/W2069702698","https://openalex.org/W2083154761","https://openalex.org/W2130725804","https://openalex.org/W2137560895","https://openalex.org/W2146164879","https://openalex.org/W2151972741","https://openalex.org/W2156323105","https://openalex.org/W2159454021","https://openalex.org/W2160565743","https://openalex.org/W2168505046","https://openalex.org/W2180109163","https://openalex.org/W2486715098","https://openalex.org/W2569646339","https://openalex.org/W2913688336","https://openalex.org/W4213060235","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W1496800439","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W1539367839","https://openalex.org/W2775068415","https://openalex.org/W2963756941","https://openalex.org/W1903284337","https://openalex.org/W4283803822"],"abstract_inverted_index":{"In":[0],"the":[1,41,49,90,112,129,133],"valley-free":[2],"path":[3,6],"model,":[4],"a":[5,8,18,25,45,53,86,94,138],"in":[7,40],"given":[9,64],"directed":[10],"graph":[11],"is":[12,32,77,114,122],"valid":[13,60,107],"if":[14],"it":[15],"consists":[16],"of":[17,20,27,37,51,56,92,132],"sequence":[19,26],"forward":[21],"edges":[22],"followed":[23],"by":[24,34],"backward":[28],"edges.":[29],"This":[30],"model":[31],"motivated":[33],"routing":[35],"policies":[36],"autonomous":[38],"systems":[39],"Internet.":[42],"We":[43,141],"give":[44,85,137],"2-approximation":[46,87],"algorithm":[47,88],"for":[48,89,119,145],"problem":[50,91,113,118],"computing":[52,93],"maximum":[54],"number":[55],"edge-":[57],"or":[58],"vertex-disjoint":[59],"paths":[61,108],"between":[62],"two":[63],"vertices":[65],"_s_":[66,100],"and":[67,69,101,109],"_t_,":[68],"we":[70,84,136],"show":[71],"that":[72,98,111],"no":[73],"better":[74],"approximation":[75],"ratio":[76],"possible":[78],"unless":[79],"_P":[80],"=":[81],"NP_.":[82],"Furthermore,":[83],"minimum":[95],"vertex":[96],"cut":[97,134],"separates":[99],"_t_":[102],"with":[103],"respect":[104],"to":[105,124],"all":[106],"prove":[110],"APXhard.":[115],"The":[116],"corresponding":[117],"edge":[120],"cuts":[121],"shown":[123],"be":[125],"polynomial-time":[126],"solvable.":[127],"For":[128],"multiway":[130],"variant":[131],"problem,":[135],"4-approximation":[139],"algorithm.":[140],"present":[142],"additional":[143],"results":[144],"acyclic":[146],"graphs.":[147]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}