Multi-Path Algorithms for minimum-colour path problems with applications to approximating barrier resilience
Let G be a graph with zero or more colours assigned to its vertices, and let vs and vt be two vertices of G. The minimum-colour path problem is to determine the minimum over all vs–vt paths of the number of colours used, where a colour is considered used if it is assigned to any vertex in the path....
Saved in:
Published in | Theoretical computer science Vol. 553; pp. 74 - 90 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
09.10.2014
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | Let G be a graph with zero or more colours assigned to its vertices, and let vs and vt be two vertices of G. The minimum-colour path problem is to determine the minimum over all vs–vt paths of the number of colours used, where a colour is considered used if it is assigned to any vertex in the path. Although this problem is NP-hard with strong hardness of approximation results, many problems can be formulated as instances of the minimum-colour path problem with additional constraints which may be exploited to allow polynomial-time solutions or close approximations. We introduce a family of approximation algorithms, referred to as the Multi-Path Algorithms, for minimum-colour path problems, and go on to show examples of constraints which would allow polynomial-time solutions or constant factor approximations.
In particular, we describe applications to variants of the barrier resilience problem: given a pair of points s and t and an arrangement A of n regions in the plane, the problem is to determine the minimum over all s–t paths of the number of regions intersected. We show how to reduce the barrier resilience problem to the minimum-colour path problem, and go on to show that the Multi-Path Algorithms guarantee a 1.5 approximation when regions are unit disks and s,t are separated by at least 23. |
---|---|
AbstractList | Let G be a graph with zero or more colours assigned to its vertices, and let and be two vertices of G. The minimum-colour path problem is to determine the minimum over all paths of the number of colours used, where a colour is considered used if it is assigned to any vertex in the path. Although this problem is NP-hard with strong hardness of approximation results, many problems can be formulated as instances of the minimum-colour path problem with additional constraints which may be exploited to allow polynomial-time solutions or close approximations. We introduce a family of approximation algorithms, referred to as the Multi-Path Algorithms, for minimum-colour path problems, and go on to show examples of constraints which would allow polynomial-time solutions or constant factor approximations. In particular, we describe applications to variants of the barrier resilience problem: given a pair of points s and t and an arrangement of n regions in the plane, the problem is to determine the minimum over all paths of the number of regions intersected. We show how to reduce the barrier resilience problem to the minimum-colour path problem, and go on to show that the Multi-Path Algorithms guarantee a 1.5 approximation when regions are unit disks and are separated by at least . Let G be a graph with zero or more colours assigned to its vertices, and let vs and vt be two vertices of G. The minimum-colour path problem is to determine the minimum over all vs–vt paths of the number of colours used, where a colour is considered used if it is assigned to any vertex in the path. Although this problem is NP-hard with strong hardness of approximation results, many problems can be formulated as instances of the minimum-colour path problem with additional constraints which may be exploited to allow polynomial-time solutions or close approximations. We introduce a family of approximation algorithms, referred to as the Multi-Path Algorithms, for minimum-colour path problems, and go on to show examples of constraints which would allow polynomial-time solutions or constant factor approximations. In particular, we describe applications to variants of the barrier resilience problem: given a pair of points s and t and an arrangement A of n regions in the plane, the problem is to determine the minimum over all s–t paths of the number of regions intersected. We show how to reduce the barrier resilience problem to the minimum-colour path problem, and go on to show that the Multi-Path Algorithms guarantee a 1.5 approximation when regions are unit disks and s,t are separated by at least 23. |
Author | Kirkpatrick, David Chan, David Yu Cheng |
Author_xml | – sequence: 1 givenname: David Yu Cheng surname: Chan fullname: Chan, David Yu Cheng email: david.chan.2012@alumni.cs.ubc.ca – sequence: 2 givenname: David surname: Kirkpatrick fullname: Kirkpatrick, David email: kirk@cs.ubc.ca |
BookMark | eNp9kMtOwzAQRS1UJNrCB7Dzkk2KHTuJI1ZVxUsqggWsrcSZtK6cONgOj7_HoayxxrJmdO7I9y7QrLc9IHRJyYoSml8fVkH5VUooX5FYpDxBcyqKMknTks_QnDDCE1YW2RlaeH8g8WRFPkfmaTRBJy9V2OO12Vmnw77zuLUOd7rX3dglyho7OjxMyOBsbSACn5HD1TAYraqgbe9xsFPv7Jfu4qTf4bpyToPDDrw2GnoF5-i0rYyHi793id7ubl83D8n2-f5xs94mihUsJLQkRSkEr_NCKZZXNVNCZCKtU5bSJl6mgKSqgZrlDREiBxAcWtYWivMqU2yJro5743feR_BBdtorMKbqwY5e0jyjPM0ELSNKj6hy1nsHrRxcNOC-JSVySlYeZExWTslKEotMmpujBqKHj2hRevXrr9EOVJCN1f-ofwD6moVO |
CitedBy_id | crossref_primary_10_1145_3396573 crossref_primary_10_1016_j_comgeo_2020_101720 crossref_primary_10_1109_LRA_2016_2524067 crossref_primary_10_1016_j_comgeo_2018_02_006 crossref_primary_10_1016_j_comgeo_2020_101650 |
Cites_doi | 10.1142/S0129626407002958 10.1007/s11276-006-9856-0 10.1016/j.comnet.2008.04.017 10.1145/285055.285059 10.1109/TNET.2007.911435 |
ContentType | Journal Article |
Copyright | 2014 Elsevier B.V. |
Copyright_xml | – notice: 2014 Elsevier B.V. |
DBID | 6I. AAFTH AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
DOI | 10.1016/j.tcs.2014.04.009 |
DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
DatabaseTitleList | Computer and Information Systems Abstracts |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Mathematics Computer Science |
EISSN | 1879-2294 |
EndPage | 90 |
ExternalDocumentID | 10_1016_j_tcs_2014_04_009 S0304397514002886 |
GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 0SF 29Q AAEDT AAQXK AAXKI AAYXX ABEFU ABFNM ABTAH ACNNM ADMUD ADVLN AFJKZ AGHFR AKRWK ASPBG AVWKF AZFZN CITATION FGOYB G-2 G8K HZ~ R2- SEW TAE WUQ XJT ZY4 7SC 8FD JQ2 L7M L~C L~D |
ID | FETCH-LOGICAL-c373t-19079884b67cc36ab3c88582b2321d3213ce02cdeb36d0886ee84ef3f7c44a5c3 |
IEDL.DBID | IXB |
ISSN | 0304-3975 |
IngestDate | Fri Aug 16 22:43:20 EDT 2024 Thu Sep 26 19:02:10 EDT 2024 Fri Feb 23 02:30:23 EST 2024 |
IsDoiOpenAccess | true |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Keywords | Wireless sensor networks Barrier coverage Minimum colour path problems in graphs Resilience |
Language | English |
License | http://www.elsevier.com/open-access/userlicense/1.0 |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c373t-19079884b67cc36ab3c88582b2321d3213ce02cdeb36d0886ee84ef3f7c44a5c3 |
Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
OpenAccessLink | https://www.sciencedirect.com/science/article/pii/S0304397514002886 |
PQID | 1651425819 |
PQPubID | 23500 |
PageCount | 17 |
ParticipantIDs | proquest_miscellaneous_1651425819 crossref_primary_10_1016_j_tcs_2014_04_009 elsevier_sciencedirect_doi_10_1016_j_tcs_2014_04_009 |
PublicationCentury | 2000 |
PublicationDate | 2014-10-09 |
PublicationDateYYYYMMDD | 2014-10-09 |
PublicationDate_xml | – month: 10 year: 2014 text: 2014-10-09 day: 09 |
PublicationDecade | 2010 |
PublicationTitle | Theoretical computer science |
PublicationYear | 2014 |
Publisher | Elsevier B.V |
Publisher_xml | – name: Elsevier B.V |
References | Cormen, Leiserson, Rivest, Stein (br0110) 2001 Coudert, Perennes, Rivano, Voge (br0040) June 2006; vol. 3 Yuan, Varma, Jue (br0010) 2005 Feige (br0090) 1998; 45 Gibson, Kanade, Varadarajan (br0140) 2011 Carr, Doddi, Konjevod, Marathe (br0060) 2000 Stefanakos (br0050) 2008; 16 Aschinger, Drescher, Gottlob, Jeavons, Thorstensen (br0080) 2011; vol. 9 Kumar, Lai, Arora (br0120) 2005 Bereg, Kirkpatrick (br0070) 2009; vol. 5804 Datta, Somani (br0030) Aug. 2008; 52 Kumar, Lai, Arora (br0130) 2007; 13 Chan (br0100) 2012 Coudert, Datta, Perennes, Rivano, Voge (br0150) June 2007; 17 Yuan (10.1016/j.tcs.2014.04.009_br0010) 2005 Cormen (10.1016/j.tcs.2014.04.009_br0110) 2001 Bereg (10.1016/j.tcs.2014.04.009_br0070) 2009; vol. 5804 Kumar (10.1016/j.tcs.2014.04.009_br0120) 2005 Aschinger (10.1016/j.tcs.2014.04.009_br0080) 2011; vol. 9 Kumar (10.1016/j.tcs.2014.04.009_br0130) 2007; 13 Chan (10.1016/j.tcs.2014.04.009_br0100) 2012 Carr (10.1016/j.tcs.2014.04.009_br0060) 2000 Coudert (10.1016/j.tcs.2014.04.009_br0150) 2007; 17 Feige (10.1016/j.tcs.2014.04.009_br0090) 1998; 45 Stefanakos (10.1016/j.tcs.2014.04.009_br0050) 2008; 16 Gibson (10.1016/j.tcs.2014.04.009_br0140) Coudert (10.1016/j.tcs.2014.04.009_br0040) 2006; vol. 3 Datta (10.1016/j.tcs.2014.04.009_br0030) 2008; 52 |
References_xml | – start-page: 345 year: 2000 end-page: 353 ident: br0060 article-title: On the red–blue set cover problem publication-title: Proceedings of the Eleventh Annual ACM–SIAM Symposium on Discrete Algorithms contributor: fullname: Marathe – year: 2012 ident: br0100 article-title: Approximating barrier resilience and related notions for disk sensors in a two-dimensional plane contributor: fullname: Chan – volume: vol. 3 start-page: 235 year: June 2006 end-page: 238 ident: br0040 article-title: Shared risk resource groups and survivability in multilayer networks publication-title: IEEE/COST 293 Annual Conference on GRAphs and ALgorithms in Communication Networks contributor: fullname: Voge – start-page: 2658 year: 2005 end-page: 2669 ident: br0010 article-title: Minimum-color path problems for reliability in mesh networks publication-title: INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, vol. 4 contributor: fullname: Jue – start-page: 284 year: 2005 end-page: 298 ident: br0120 article-title: Barrier coverage with wireless sensors publication-title: Proceedings of the 11th Annual International Conference on Mobile Computing and Networking contributor: fullname: Arora – volume: vol. 9 start-page: 12 year: 2011 end-page: 28 ident: br0080 article-title: Structural decomposition methods and what they are good for publication-title: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) contributor: fullname: Thorstensen – volume: 16 start-page: 1331 year: 2008 end-page: 1339 ident: br0050 article-title: Reliable routings in networks with generalized link failure events publication-title: IEEE/ACM Trans. Netw. contributor: fullname: Stefanakos – volume: 45 start-page: 634 year: 1998 end-page: 652 ident: br0090 article-title: A threshold of ln publication-title: J. ACM contributor: fullname: Feige – year: 2011 ident: br0140 article-title: On isolating points using disks contributor: fullname: Varadarajan – volume: 52 start-page: 2381 year: Aug. 2008 end-page: 2394 ident: br0030 article-title: Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures publication-title: Comput. Netw. contributor: fullname: Somani – volume: 17 start-page: 169 year: June 2007 end-page: 184 ident: br0150 article-title: Shared Risk Resource Group: complexity and approximability issues publication-title: Parallel Process. Lett. contributor: fullname: Voge – volume: 13 start-page: 817 year: 2007 end-page: 834 ident: br0130 article-title: Barrier coverage with wireless sensors publication-title: Wirel. Netw. contributor: fullname: Arora – volume: vol. 5804 start-page: 29 year: 2009 end-page: 40 ident: br0070 article-title: Approximating barrier resilience in wireless sensor networks publication-title: Algorithmic Aspects of Wireless Sensor Networks contributor: fullname: Kirkpatrick – year: 2001 ident: br0110 article-title: Introduction to Algorithms contributor: fullname: Stein – volume: 17 start-page: 169 issue: 2 year: 2007 ident: 10.1016/j.tcs.2014.04.009_br0150 article-title: Shared Risk Resource Group: complexity and approximability issues publication-title: Parallel Process. Lett. doi: 10.1142/S0129626407002958 contributor: fullname: Coudert – volume: vol. 9 start-page: 12 year: 2011 ident: 10.1016/j.tcs.2014.04.009_br0080 article-title: Structural decomposition methods and what they are good for contributor: fullname: Aschinger – start-page: 2658 year: 2005 ident: 10.1016/j.tcs.2014.04.009_br0010 article-title: Minimum-color path problems for reliability in mesh networks contributor: fullname: Yuan – year: 2001 ident: 10.1016/j.tcs.2014.04.009_br0110 contributor: fullname: Cormen – start-page: 345 year: 2000 ident: 10.1016/j.tcs.2014.04.009_br0060 article-title: On the red–blue set cover problem contributor: fullname: Carr – volume: 13 start-page: 817 year: 2007 ident: 10.1016/j.tcs.2014.04.009_br0130 article-title: Barrier coverage with wireless sensors publication-title: Wirel. Netw. doi: 10.1007/s11276-006-9856-0 contributor: fullname: Kumar – volume: vol. 3 start-page: 235 year: 2006 ident: 10.1016/j.tcs.2014.04.009_br0040 article-title: Shared risk resource groups and survivability in multilayer networks contributor: fullname: Coudert – volume: vol. 5804 start-page: 29 year: 2009 ident: 10.1016/j.tcs.2014.04.009_br0070 article-title: Approximating barrier resilience in wireless sensor networks contributor: fullname: Bereg – year: 2012 ident: 10.1016/j.tcs.2014.04.009_br0100 contributor: fullname: Chan – start-page: 284 year: 2005 ident: 10.1016/j.tcs.2014.04.009_br0120 article-title: Barrier coverage with wireless sensors contributor: fullname: Kumar – ident: 10.1016/j.tcs.2014.04.009_br0140 contributor: fullname: Gibson – volume: 52 start-page: 2381 issue: 12 year: 2008 ident: 10.1016/j.tcs.2014.04.009_br0030 article-title: Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures publication-title: Comput. Netw. doi: 10.1016/j.comnet.2008.04.017 contributor: fullname: Datta – volume: 45 start-page: 634 year: 1998 ident: 10.1016/j.tcs.2014.04.009_br0090 article-title: A threshold of ln n for approximating set cover publication-title: J. ACM doi: 10.1145/285055.285059 contributor: fullname: Feige – volume: 16 start-page: 1331 year: 2008 ident: 10.1016/j.tcs.2014.04.009_br0050 article-title: Reliable routings in networks with generalized link failure events publication-title: IEEE/ACM Trans. Netw. doi: 10.1109/TNET.2007.911435 contributor: fullname: Stefanakos |
SSID | ssj0000576 |
Score | 2.2203329 |
Snippet | Let G be a graph with zero or more colours assigned to its vertices, and let vs and vt be two vertices of G. The minimum-colour path problem is to determine... Let G be a graph with zero or more colours assigned to its vertices, and let and be two vertices of G. The minimum-colour path problem is to determine the... |
SourceID | proquest crossref elsevier |
SourceType | Aggregation Database Publisher |
StartPage | 74 |
SubjectTerms | Algorithms Approximation Barrier coverage Barriers Color Colour Mathematical analysis Mathematical models Minimum colour path problems in graphs Resilience Wireless sensor networks |
Title | Multi-Path Algorithms for minimum-colour path problems with applications to approximating barrier resilience |
URI | https://dx.doi.org/10.1016/j.tcs.2014.04.009 https://search.proquest.com/docview/1651425819 |
Volume | 553 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB6qXvTgoyo-ywqehNg2u9mkxypKtSqCVnpbsptEI20qbQqe_O3ObBNfiAchIWTZbMI-vpnJzH4DcEhGspto3wkTbhwRhbjmeBg4XIhEBzJxQ8u2f30jOz1x2ff6FTgt98JQWGWB_TNMt2hdlNSL3qy_pGn9jpx6KE1R4pPhEBDtNnF70ia-_sknGnv-zF9JHgCsXXo2bYxXboixuyks2ynFJP4um36gtBU956uwXOiMrD37rDWoxFkVVsp8DKxYnlVYuv7gYJ2sw8DurXVusYy1B4-jcZo_DScMlVRGfCLD6dAhxurpmFFWYlZklpkw-jPLvvq1WT5ilnr8NaW2s0emwzElumNoqqcD-_IN6J2f3Z92nCK3gmO4z3MH9QBiKhNa-sZwGWpugsALXI0aVjPCk5u44ZoIbW0ZIRLJOA5EnPDEN0KEnuGbMJ-NsngLGDeoVhisxLknuJFa-4kXJZ7EBhstLbfhqOxV9TKj0FBlbNmzwiFQNASqgUejtQ2i7Hf1bR4ohPi_Hjsox0jh-iCnR5jFo-lENSVOENdDxWfnf03vwiLd2QC-1h7M5-NpvI-KSK5rMHf81qzBQvvkoXtF14tu56Zm59876i_hPQ |
link.rule.ids | 315,786,790,3525,4521,24144,27602,27957,27958,45620,45698,45714,45909 |
linkProvider | Elsevier |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB60HtSDb_HtCp6E0Db7SHosotRHi6CCtyW7SWqkTaVNwZ_vzDbxhXgQkssmuxv2MfNNZvYbgFMykv3UBF6UcuuJOMI9x6PQ40KkJlSpHzm2_W5PdR7F9ZN8moPz6iwMhVWWsn8m0520Lkvq5WjWX7Osfk9OPdSmqPHJcAjVPCwIGTRFDRbaVzed3qdAlsHMZUlOAKxQOTddmFdhibS7KRzhKYUl_q6efghqp30u12ClhI2sPfuydZhL8g1YrVIysHKHbsBy94OGdbIJA3e81rvDMtYe9EfjrHgeThjiVEaUIsPp0CPS6umYUWJiViaXmTD6Ocu-urZZMWKOffwto7bzPjPRmHLdMbTWs4HrfAseLy8ezjtemV7BszzghYdQgMjKhFGBtVxFhtswlKFvEGQ1Y7y5TRq-jdHcVjEKI5UkoUhSngZWiEhavg21fJQnO8C4RWRh8SXOpeBWGROkMk6lwgYbLaN24awaVf06Y9HQVXjZi8Yp0DQFuoFXo7ULohp3_W0paJTyf1U7qeZI4xYhv0eUJ6PpRDcVrhFfIvbZ-1_Tx7DYeeje6tur3s0-LNETF8_XOoBaMZ4mh4hLCnNUrrt3SPThUw |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Multi-Path+Algorithms+for+minimum-colour+path+problems+with+applications+to+approximating+barrier+resilience&rft.jtitle=Theoretical+computer+science&rft.au=Chan%2C+David+Yu+Cheng&rft.au=Kirkpatrick%2C+David&rft.date=2014-10-09&rft.issn=0304-3975&rft.volume=553&rft.spage=74&rft.epage=90&rft_id=info:doi/10.1016%2Fj.tcs.2014.04.009&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2014_04_009 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |