Prune-and-search with limited workspace
Prune-and-search is an excellent algorithmic paradigm for solving various optimization problems. We provide a general scheme for prune-and-search technique and show how to implement it in space-efficient manner. We consider both the in-place and read-only model which have several advantages compared...
Uloženo v:
| Vydáno v: | Journal of computer and system sciences Ročník 81; číslo 2; s. 398 - 414 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Inc
01.03.2015
|
| Témata: | |
| ISSN: | 0022-0000, 1090-2724 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Prune-and-search is an excellent algorithmic paradigm for solving various optimization problems. We provide a general scheme for prune-and-search technique and show how to implement it in space-efficient manner. We consider both the in-place and read-only model which have several advantages compared to the traditional model of computation. Our technique can be applied to a large number of problems which accept prune-and-search. For examples, we study the following problems each of which has tremendous practical usage apart from theoretical implication:•computing the minimum enclosing circle (MEC) of a set of n points in R2, and•linear programming problems with two and three variables and n constraints. In the in-place setting, all these problems can be solved in O(n) time using O(1) extra-space. In the read-only setup, the time and extra-space complexities of the proposed algorithms for all these problems are O(npolylog(n)) and O(polylog(n)), respectively. |
|---|---|
| AbstractList | Prune-and-search is an excellent algorithmic paradigm for solving various optimization problems. We provide a general scheme for prune-and-search technique and show how to implement it in space-efficient manner. We consider both the in-place and read-only model which have several advantages compared to the traditional model of computation. Our technique can be applied to a large number of problems which accept prune-and-search. For examples, we study the following problems each of which has tremendous practical usage apart from theoretical implication:•computing the minimum enclosing circle (MEC) of a set of n points in R2, and•linear programming problems with two and three variables and n constraints. In the in-place setting, all these problems can be solved in O(n) time using O(1) extra-space. In the read-only setup, the time and extra-space complexities of the proposed algorithms for all these problems are O(npolylog(n)) and O(polylog(n)), respectively. |
| Author | De, Minati Roy, Sasanka Nandy, Subhas C. |
| Author_xml | – sequence: 1 givenname: Minati surname: De fullname: De, Minati organization: The Technion—Israel Institute of Technology, Haifa 32000, Israel – sequence: 2 givenname: Subhas C. surname: Nandy fullname: Nandy, Subhas C. organization: Indian Statistical Institute, Kolkata 700108, India – sequence: 3 givenname: Sasanka surname: Roy fullname: Roy, Sasanka organization: Chennai Mathematical Institute, Chennai, 603103, India |
| BookMark | eNp9zz1PwzAQgGELFYm28AeYujE5nJ3ESSQWVPElVYIBZss5n1WHNqlsQ8W_J1WZGHrLLfec9M7YpB96YuxaQCZAqNsu6zDGTIIoMqgzAHHGpgIa4LKSxYRNAaTkMM4Fm8XYjQeiVPmU3byFr5646S2PZAKuF3uf1ouN3_pEdrEfwmfcGaRLdu7MJtLV356zj8eH9-UzX70-vSzvVxxzgMQVyqahAqhVpbWNqoQtsKTKKdeWqmlljgacqNrSUVXZ1mHtTFFAW-d5I8Hkc1Yf_2IYYgzkNPpkkh_6FIzfaAH6EKw7fQjWh2ANtR57Rir_0V3wWxN-TqO7I6Ix6ttT0BE99UjWB8Kk7eBP8V_gfXFU |
| CitedBy_id | crossref_primary_10_1145_3452938 crossref_primary_10_2514_1_B39553 |
| Cites_doi | 10.1016/0304-3975(95)00225-1 10.1287/trsc.6.4.379 10.1016/j.comgeo.2006.03.006 10.1007/BF02187750 10.1145/2157.322410 10.1007/BF02574699 10.1007/s00454-006-1275-6 10.1137/0215021 10.1137/0212052 10.1145/2422.322418 10.1016/j.tcs.2003.05.004 10.1287/moor.8.4.498 10.1007/s00453-008-9193-z 10.1016/0196-6774(86)90027-1 |
| ContentType | Journal Article |
| Copyright | 2014 Elsevier Inc. |
| Copyright_xml | – notice: 2014 Elsevier Inc. |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.jcss.2014.08.001 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1090-2724 |
| EndPage | 414 |
| ExternalDocumentID | 10_1016_j_jcss_2014_08_001 S0022000014001172 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1~. 1~5 29K 4.4 457 4G. 5GY 5VS 6I. 6TJ 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN AAYJJ ABBOA ABEFU ABJNI ABMAC ABTAH ABVKL ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADMUD AEBSH AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CAG COF CS3 D-I DM4 DU5 EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG5 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OHT OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSV SSZ T5K TN5 TWZ UPT WH7 WUQ XJT XOL XPP YQT ZCG ZMT ZU3 ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c300t-6c299e40eb65dd9671d4c5e7f6fb569b23ca0f17b5fe77dbfc8fa440b833920a3 |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000345822400004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0022-0000 |
| IngestDate | Sat Nov 29 04:16:28 EST 2025 Tue Nov 18 22:29:28 EST 2025 Fri Feb 23 02:19:39 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Space-efficient algorithms Prune-and-search Low dimensional linear programming In-place algorithms Read-only memory algorithms Minimum enclosing circle |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c300t-6c299e40eb65dd9671d4c5e7f6fb569b23ca0f17b5fe77dbfc8fa440b833920a3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.jcss.2014.08.001 |
| PageCount | 17 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_jcss_2014_08_001 crossref_primary_10_1016_j_jcss_2014_08_001 elsevier_sciencedirect_doi_10_1016_j_jcss_2014_08_001 |
| PublicationCentury | 2000 |
| PublicationDate | March 2015 2015-03-00 |
| PublicationDateYYYYMMDD | 2015-03-01 |
| PublicationDate_xml | – month: 03 year: 2015 text: March 2015 |
| PublicationDecade | 2010 |
| PublicationTitle | Journal of computer and system sciences |
| PublicationYear | 2015 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Welzl (br0270) 1991 Sylvester (br0260) 1857; 1 Megiddo (br0160) 1983; 30 Asano, Mulzer, Rote, Wang (br0020) 2011; 2 Megiddo (br0190) 1984; 31 Megiddo (br0180) 1983; 8 Karmarkar (br0120) 1984 Chan, Chen (br0090) 2007; 37 Megiddo (br0170) 1983; 12 Elzinga, Hearn (br0110) 1972; 6 Brönnimann, Chan, Chen (br0060) 2004 Megiddo, Zemel (br0210) 1986; 7 Barba, Korman, Langerman, Silveira, Sadakane (br0030) 2013 Brönnimann, Iacono, Katajainen, Morin, Morrison, Toussaint (br0070) 2004; 321 Carlsson, Sundström (br0080) 1995 Munro, Raman (br0220) 1996; 165 Khachiyan (br0130) 1979; 20 Megiddo (br0200) 1989; 4 Kirkpatrick, Seidel (br0140) 1986; 15 M. Korman, Private communication. Raman, Ramnath (br0240) 1999; 6 Seidel (br0250) 1991; 6 Asano, Doerr (br0010) 2011 Blunck, Vahrenhold (br0040) 2010; 57 Preparata, Shamos (br0230) 1990 Bose, Maheshwari, Morin, Morrison, Smid, Vahrenhold (br0050) 2007; 37 De, Nandy, Roy (br0100) Brönnimann (10.1016/j.jcss.2014.08.001_br0070) 2004; 321 Megiddo (10.1016/j.jcss.2014.08.001_br0190) 1984; 31 Blunck (10.1016/j.jcss.2014.08.001_br0040) 2010; 57 Megiddo (10.1016/j.jcss.2014.08.001_br0160) 1983; 30 Sylvester (10.1016/j.jcss.2014.08.001_br0260) 1857; 1 Raman (10.1016/j.jcss.2014.08.001_br0240) 1999; 6 Khachiyan (10.1016/j.jcss.2014.08.001_br0130) 1979; 20 Megiddo (10.1016/j.jcss.2014.08.001_br0210) 1986; 7 Welzl (10.1016/j.jcss.2014.08.001_br0270) 1991 Brönnimann (10.1016/j.jcss.2014.08.001_br0060) 2004 10.1016/j.jcss.2014.08.001_br0150 Megiddo (10.1016/j.jcss.2014.08.001_br0170) 1983; 12 Munro (10.1016/j.jcss.2014.08.001_br0220) 1996; 165 Elzinga (10.1016/j.jcss.2014.08.001_br0110) 1972; 6 Barba (10.1016/j.jcss.2014.08.001_br0030) 2013 Carlsson (10.1016/j.jcss.2014.08.001_br0080) 1995 De (10.1016/j.jcss.2014.08.001_br0100) Karmarkar (10.1016/j.jcss.2014.08.001_br0120) 1984 Megiddo (10.1016/j.jcss.2014.08.001_br0200) 1989; 4 Preparata (10.1016/j.jcss.2014.08.001_br0230) 1990 Kirkpatrick (10.1016/j.jcss.2014.08.001_br0140) 1986; 15 Chan (10.1016/j.jcss.2014.08.001_br0090) 2007; 37 Asano (10.1016/j.jcss.2014.08.001_br0020) 2011; 2 Megiddo (10.1016/j.jcss.2014.08.001_br0180) 1983; 8 Asano (10.1016/j.jcss.2014.08.001_br0010) 2011 Bose (10.1016/j.jcss.2014.08.001_br0050) 2007; 37 Seidel (10.1016/j.jcss.2014.08.001_br0250) 1991; 6 |
| References_xml | – volume: 6 start-page: 379 year: 1972 end-page: 394 ident: br0110 article-title: Geometrical solutions for some minimax location problems publication-title: Transp. Sci. – start-page: 359 year: 1991 end-page: 370 ident: br0270 article-title: Smallest enclosing disks (balls and ellipsoids) publication-title: Results and New Trends in Computer Science – ident: br0100 article-title: Convex hull and linear programming in read-only setup with limited work-space – start-page: 244 year: 1995 end-page: 253 ident: br0080 article-title: Linear-time in-place selection in less than 3 publication-title: ISAAC – start-page: 302 year: 1984 end-page: 311 ident: br0120 article-title: A new polynomial-time algorithm for linear programming publication-title: STOC – volume: 15 start-page: 287 year: 1986 end-page: 299 ident: br0140 article-title: The ultimate planar convex hull algorithm? publication-title: SIAM J. Comput. – year: 1990 ident: br0230 article-title: Computational Geometry: An Introduction – start-page: 281 year: 2013 end-page: 292 ident: br0030 article-title: Space-time trade-offs for stack-based algorithms publication-title: STACS – volume: 12 start-page: 759 year: 1983 end-page: 776 ident: br0170 article-title: Linear-time algorithms for linear programming in publication-title: SIAM J. Comput. – volume: 321 start-page: 25 year: 2004 end-page: 40 ident: br0070 article-title: Space-efficient planar convex hull algorithms publication-title: Theor. Comput. Sci. – volume: 6 start-page: 162 year: 1999 end-page: 180 ident: br0240 article-title: Improved upper bounds for time–space trade-offs for selection publication-title: Nord. J. Comput. – volume: 57 start-page: 1 year: 2010 end-page: 21 ident: br0040 article-title: In-place algorithms for computing (layers of) maxima publication-title: Algorithmica – start-page: 239 year: 2004 end-page: 246 ident: br0060 article-title: Towards in-place geometric algorithms and data structures publication-title: Symp. on Comput. Geom – volume: 37 start-page: 209 year: 2007 end-page: 227 ident: br0050 article-title: Space-efficient geometric divide-and-conquer algorithms publication-title: Comput. Geom. – volume: 31 start-page: 114 year: 1984 end-page: 127 ident: br0190 article-title: Linear programming in linear time when the dimension is fixed publication-title: J. ACM – volume: 6 start-page: 423 year: 1991 end-page: 434 ident: br0250 article-title: Small-dimensional linear programming and convex hulls made easy publication-title: Discrete Comput. Geom. – volume: 2 start-page: 46 year: 2011 end-page: 68 ident: br0020 article-title: Constant-work-space algorithms for geometric problems publication-title: J. Comput. Geom. – volume: 30 start-page: 852 year: 1983 end-page: 865 ident: br0160 article-title: Applying parallel computation algorithms in the design of serial algorithms publication-title: J. ACM – volume: 1 start-page: 79 year: 1857 ident: br0260 article-title: A question in the geometry of situation publication-title: Q. J. Math. – volume: 4 start-page: 605 year: 1989 end-page: 610 ident: br0200 article-title: On the ball spanned by balls publication-title: Discrete Comput. Geom. – volume: 37 start-page: 79 year: 2007 end-page: 102 ident: br0090 article-title: Multi-pass geometric algorithms publication-title: Discrete Comput. Geom. – volume: 20 start-page: 191 year: 1979 end-page: 194 ident: br0130 article-title: A polynomial algorithm in linear programming publication-title: Sov. Math. Dokl. – volume: 165 start-page: 311 year: 1996 end-page: 323 ident: br0220 article-title: Selection from read-only memory and sorting with minimum data movement publication-title: Theor. Comput. Sci. – volume: 7 start-page: 358 year: 1986 end-page: 368 ident: br0210 article-title: An publication-title: J. Algorithms – volume: 8 start-page: 498 year: 1983 end-page: 504 ident: br0180 article-title: The weighted Euclidean 1-center problem publication-title: Math. Oper. Res. – reference: M. Korman, Private communication. – year: 2011 ident: br0010 article-title: Memory-constrained algorithms for shortest path problem publication-title: CCCG – volume: 165 start-page: 311 issue: 2 year: 1996 ident: 10.1016/j.jcss.2014.08.001_br0220 article-title: Selection from read-only memory and sorting with minimum data movement publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(95)00225-1 – volume: 2 start-page: 46 issue: 1 year: 2011 ident: 10.1016/j.jcss.2014.08.001_br0020 article-title: Constant-work-space algorithms for geometric problems publication-title: J. Comput. Geom. – start-page: 244 year: 1995 ident: 10.1016/j.jcss.2014.08.001_br0080 article-title: Linear-time in-place selection in less than 3n comparisons – start-page: 239 year: 2004 ident: 10.1016/j.jcss.2014.08.001_br0060 article-title: Towards in-place geometric algorithms and data structures – volume: 6 start-page: 379 issue: 4 year: 1972 ident: 10.1016/j.jcss.2014.08.001_br0110 article-title: Geometrical solutions for some minimax location problems publication-title: Transp. Sci. doi: 10.1287/trsc.6.4.379 – volume: 37 start-page: 209 issue: 3 year: 2007 ident: 10.1016/j.jcss.2014.08.001_br0050 article-title: Space-efficient geometric divide-and-conquer algorithms publication-title: Comput. Geom. doi: 10.1016/j.comgeo.2006.03.006 – volume: 4 start-page: 605 year: 1989 ident: 10.1016/j.jcss.2014.08.001_br0200 article-title: On the ball spanned by balls publication-title: Discrete Comput. Geom. doi: 10.1007/BF02187750 – start-page: 281 year: 2013 ident: 10.1016/j.jcss.2014.08.001_br0030 article-title: Space-time trade-offs for stack-based algorithms – year: 2011 ident: 10.1016/j.jcss.2014.08.001_br0010 article-title: Memory-constrained algorithms for shortest path problem – volume: 30 start-page: 852 issue: 4 year: 1983 ident: 10.1016/j.jcss.2014.08.001_br0160 article-title: Applying parallel computation algorithms in the design of serial algorithms publication-title: J. ACM doi: 10.1145/2157.322410 – volume: 6 start-page: 423 year: 1991 ident: 10.1016/j.jcss.2014.08.001_br0250 article-title: Small-dimensional linear programming and convex hulls made easy publication-title: Discrete Comput. Geom. doi: 10.1007/BF02574699 – volume: 6 start-page: 162 issue: 2 year: 1999 ident: 10.1016/j.jcss.2014.08.001_br0240 article-title: Improved upper bounds for time–space trade-offs for selection publication-title: Nord. J. Comput. – start-page: 302 year: 1984 ident: 10.1016/j.jcss.2014.08.001_br0120 article-title: A new polynomial-time algorithm for linear programming – volume: 37 start-page: 79 issue: 1 year: 2007 ident: 10.1016/j.jcss.2014.08.001_br0090 article-title: Multi-pass geometric algorithms publication-title: Discrete Comput. Geom. doi: 10.1007/s00454-006-1275-6 – year: 1990 ident: 10.1016/j.jcss.2014.08.001_br0230 – volume: 20 start-page: 191 year: 1979 ident: 10.1016/j.jcss.2014.08.001_br0130 article-title: A polynomial algorithm in linear programming publication-title: Sov. Math. Dokl. – volume: 15 start-page: 287 issue: 1 year: 1986 ident: 10.1016/j.jcss.2014.08.001_br0140 article-title: The ultimate planar convex hull algorithm? publication-title: SIAM J. Comput. doi: 10.1137/0215021 – volume: 12 start-page: 759 issue: 4 year: 1983 ident: 10.1016/j.jcss.2014.08.001_br0170 article-title: Linear-time algorithms for linear programming in R3 and related problems publication-title: SIAM J. Comput. doi: 10.1137/0212052 – volume: 31 start-page: 114 issue: 1 year: 1984 ident: 10.1016/j.jcss.2014.08.001_br0190 article-title: Linear programming in linear time when the dimension is fixed publication-title: J. ACM doi: 10.1145/2422.322418 – volume: 321 start-page: 25 issue: 1 year: 2004 ident: 10.1016/j.jcss.2014.08.001_br0070 article-title: Space-efficient planar convex hull algorithms publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2003.05.004 – volume: 8 start-page: 498 issue: 4 year: 1983 ident: 10.1016/j.jcss.2014.08.001_br0180 article-title: The weighted Euclidean 1-center problem publication-title: Math. Oper. Res. doi: 10.1287/moor.8.4.498 – ident: 10.1016/j.jcss.2014.08.001_br0150 – ident: 10.1016/j.jcss.2014.08.001_br0100 – volume: 57 start-page: 1 issue: 1 year: 2010 ident: 10.1016/j.jcss.2014.08.001_br0040 article-title: In-place algorithms for computing (layers of) maxima publication-title: Algorithmica doi: 10.1007/s00453-008-9193-z – volume: 1 start-page: 79 year: 1857 ident: 10.1016/j.jcss.2014.08.001_br0260 article-title: A question in the geometry of situation publication-title: Q. J. Math. – volume: 7 start-page: 358 issue: 3 year: 1986 ident: 10.1016/j.jcss.2014.08.001_br0210 article-title: An O(nlogn) randomizing algorithm for the weighted Euclidean 1-center problem publication-title: J. Algorithms doi: 10.1016/0196-6774(86)90027-1 – start-page: 359 year: 1991 ident: 10.1016/j.jcss.2014.08.001_br0270 article-title: Smallest enclosing disks (balls and ellipsoids) |
| SSID | ssj0011563 |
| Score | 2.080009 |
| Snippet | Prune-and-search is an excellent algorithmic paradigm for solving various optimization problems. We provide a general scheme for prune-and-search technique and... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 398 |
| SubjectTerms | In-place algorithms Low dimensional linear programming Minimum enclosing circle Prune-and-search Read-only memory algorithms Space-efficient algorithms |
| Title | Prune-and-search with limited workspace |
| URI | https://dx.doi.org/10.1016/j.jcss.2014.08.001 |
| Volume | 81 |
| WOSCitedRecordID | wos000345822400004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1090-2724 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0011563 issn: 0022-0000 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9wwEBZhk0N66CNtSfrCh0IOi4JsyZJ9DCGl7SHkkMLejJ4k2-CE9W7Iz-_oYXs3KaEt9GKM0NhGM8yM5_Uh9NlJA39dluGSGoZZkTtcK2mw5uDLakG5NSaATYizs2o2q89TEXsX4ARE21b39_Xtf2U1rAGzfevsX7B7eCgswD0wHa7Adrj-EePPF6vWYtkanCIaIdR6HRuZAjQMKBG9WQE0eqU6oTyEpEIc8zxNVnKEoI_R7CsfSByCybA_lo2t1KXspidHYyonrstOtj_lepQhL8cyqxj66ttfNqozQyuAt3jRmEQNSmqCCxEbo3sVG1FZkigVa_qSRgjqZHpZ7Cd9pNVjgGF-NNedn7CeszB1NX3e5rRsn3wuQsqChXF3YJ23C1HW1QRtH387nX0fUkzw40r7UfKeIHVUxeK_h2_6vdey5olcvETPE7Oy48j6V2jLtnvoRQ_PkSVtvYeerc2afI0OH8pF5uUiS3KRDXLxBv34cnpx8hUnlAysKSFLzDV4FJYRq3hpTM1FbpgurXDcqZLXqqBaEpcLVTorhFFOV04yRlRFwTcmkr5Fk_amtfsok8AOZ4lSnGomBJUEaLhRNaOyUEYcoLw_hUanEfIeyeS66WsF540_ucafXOPhTUl-gKYDzW0coPLk7rI_3CYJd3TtGpCFJ-je_SPde7Q7SvsHNFkuVvYj2tF3y6tu8SmJzC-_k37t |
| linkProvider | Elsevier |
| 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=Prune-and-search+with+limited+workspace&rft.jtitle=Journal+of+computer+and+system+sciences&rft.au=De%2C+Minati&rft.au=Nandy%2C+Subhas+C.&rft.au=Roy%2C+Sasanka&rft.date=2015-03-01&rft.pub=Elsevier+Inc&rft.issn=0022-0000&rft.eissn=1090-2724&rft.volume=81&rft.issue=2&rft.spage=398&rft.epage=414&rft_id=info:doi/10.1016%2Fj.jcss.2014.08.001&rft.externalDocID=S0022000014001172 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0022-0000&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0022-0000&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0022-0000&client=summon |