An approximation polynomial-time algorithm for a sequence bi-clustering problem
We consider a strongly NP-hard problem of partitioning a finite sequence of vectors in Euclidean space into two clusters using the criterion of the minimal sum of the squared distances from the elements of the clusters to the centers of the clusters. The center of one of the clusters is to be optimi...
Saved in:
| Published in: | Computational mathematics and mathematical physics Vol. 55; no. 6; pp. 1068 - 1076 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Moscow
Pleiades Publishing
01.06.2015
Springer Nature B.V |
| Subjects: | |
| ISSN: | 0965-5425, 1555-6662 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We consider a strongly NP-hard problem of partitioning a finite sequence of vectors in Euclidean space into two clusters using the criterion of the minimal sum of the squared distances from the elements of the clusters to the centers of the clusters. The center of one of the clusters is to be optimized and is determined as the mean value over all vectors in this cluster. The center of the other cluster is fixed at the origin. Moreover, the partition is such that the difference between the indices of two successive vectors in the first cluster is bounded above and below by prescribed constants. A 2-approximation polynomial-time algorithm is proposed for this problem. |
|---|---|
| AbstractList | We consider a strongly NP-hard problem of partitioning a finite sequence of vectors in Euclidean space into two clusters using the criterion of the minimal sum of the squared distances from the elements of the clusters to the centers of the clusters. The center of one of the clusters is to be optimized and is determined as the mean value over all vectors in this cluster. The center of the other cluster is fixed at the origin. Moreover, the partition is such that the difference between the indices of two successive vectors in the first cluster is bounded above and below by prescribed constants. A 2-approximation polynomial-time algorithm is proposed for this problem. |
| Author | Kel’manov, A. V. Khamidullin, S. A. |
| Author_xml | – sequence: 1 givenname: A. V. surname: Kel’manov fullname: Kel’manov, A. V. email: kelm@math.nsc.ru organization: Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk State University – sequence: 2 givenname: S. A. surname: Khamidullin fullname: Khamidullin, S. A. email: kham@math.nsc.ru organization: Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences |
| BookMark | eNp9kL1OwzAUhS1UJNrCA7BFYmEJ2Int2GNV8SdV6gDMkePYxZVjBzuV6NvjUAZUBNMdzvnuPffMwMR5pwC4RPAGoRLfPkNOCcEFQQRSCCk7AVNECMkppcUETEc5H_UzMItxCyGinJVTsF64TPR98B-mE4PxLuu93TvfGWHzwXQqE3bjgxneukz7kIksqvedclJljcml3cVBBeM2WVrRWNWdg1MtbFQX33MOXu_vXpaP-Wr98LRcrHJZYj7kgmtdSqh4K3GpGcdaKlZUqIVatLxClaBtAYnUECvWNphg1Ka3mqpABWOqKOfg-rA33U154lB3JkplrXDK72KNKsR4oihL1qsj69bvgkvp6iRzBjHhNLmqg0sGH2NQupZm-GpkCMLYGsF6LLr-VXQi0RHZh1Rm2P_LFAcm9mN7KvzI9Cf0CT_YkGQ |
| CitedBy_id | crossref_primary_10_1134_S0965542517080085 crossref_primary_10_1134_S105466181804017X crossref_primary_10_1186_s12859_016_1257_5 crossref_primary_10_3390_life6010007 crossref_primary_10_1134_S0965542518120138 |
| Cites_doi | 10.1134/S1064562408040273 10.1134/S0965542509110128 10.1126/science.1223269 10.1007/s10994-009-5103-0 10.1134/S0081543808060096 10.1016/j.patrec.2009.09.011 10.1134/S1990478913040066 10.1109/TSP.2003.822285 10.1134/S1990478912010097 10.1134/S1990478913030095 10.1007/978-0-387-21606-5 |
| ContentType | Journal Article |
| Copyright | Pleiades Publishing, Ltd. 2015 |
| Copyright_xml | – notice: Pleiades Publishing, Ltd. 2015 |
| DBID | AAYXX CITATION 3V. 7SC 7TB 7U5 7WY 7WZ 7XB 87Z 88I 8AL 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FR3 FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- KR7 L.- L.0 L6V L7M L~C L~D M0C M0N M2P M7S P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS PYYUZ Q9U |
| DOI | 10.1134/S0965542515060068 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Solid State and Superconductivity Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) Science Database (Alumni Edition) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central Business Premium Collection ProQuest Technology Collection ProQuest One ProQuest Central Korea Engineering Research Database Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database Civil Engineering Abstracts ABI/INFORM Professional Advanced ABI/INFORM Professional Standard ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Science Database Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Proquest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ABI/INFORM Collection China ProQuest Central Basic |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition Solid State and Superconductivity Abstracts Engineering Research Database ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ABI/INFORM Professional Standard ProQuest Central Korea Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) Civil Engineering Abstracts ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ABI/INFORM China ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | ProQuest Business Collection (Alumni Edition) Civil Engineering Abstracts |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences Mathematics |
| EISSN | 1555-6662 |
| EndPage | 1076 |
| ExternalDocumentID | 3719718891 10_1134_S0965542515060068 |
| Genre | Feature |
| GroupedDBID | --K -5D -5G -BR -EM -Y2 -~C -~X .VR 06D 0R~ 0VY 1B1 1N0 29F 2J2 2JN 2JY 2KG 2KM 2LR 2VQ 2~H 30V 3V. 4.4 408 40D 40E 5GY 5VS 6J9 6NX 7WY 88I 8FE 8FG 8FH 8FL 8TC 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABDZT ABECU ABEFU ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACREN ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AETLH AEVLU AEXYK AFBBN AFFNX AFGCZ AFKRA AFLOW AFQWF AFWTZ AFYQB AFZKB AGAYW AGDGC AGJBK AGMZJ AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMTXH AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ ASPBG AVWKF AXYYD AZFZN AZQEC B-. BA0 BAPOH BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP DDRTE DNIVK DPUIP DU5 DWQXO EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GROUPED_ABI_INFORM_COMPLETE H13 HCIFZ HF~ HG6 HLICF HMJXF HRMNR HVGLF HZ~ H~9 I-F IHE IJ- IKXTQ IWAJR IXD I~X I~Z J-C JBSCW JZLTJ K60 K6V K6~ K7- KOV L6V LK5 LLZTM M0C M0N M2P M41 M4Y M7R M7S MA- MK~ N2Q NB0 NPVJJ NQ- NQJWS NU0 O9- O93 O9J P62 P9R PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PTHSS Q2X QOS R89 R9I RIG RNS ROL RPZ RSV S16 S1Z S27 S3B SAP SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TUC TUS UG4 UOJIU UTJUX UZXMN VC2 VFIZW VOH W23 W48 WK8 XPP XU3 YLTOR ZMTXR ~A9 AAPKM AAYXX ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR CITATION PHGZM PHGZT PQGLB 7SC 7TB 7U5 7XB 8AL 8FD 8FK FR3 JQ2 KR7 L.- L.0 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c349t-a9ff3c0e9dc43f894fce8271d0fad9717a6d205cf04e8db4541d600b721288e23 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000356505400013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0965-5425 |
| IngestDate | Sun Nov 09 11:58:07 EST 2025 Tue Oct 07 13:13:01 EDT 2025 Sat Nov 29 05:16:03 EST 2025 Tue Nov 18 21:34:34 EST 2025 Fri Feb 21 02:38:00 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Keywords | NP-hardness approximation polynomial-time algorithm clustering minimum of the sum of squared distances sequence of Euclidean vectors |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c349t-a9ff3c0e9dc43f894fce8271d0fad9717a6d205cf04e8db4541d600b721288e23 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1689804596 |
| PQPubID | 60276 |
| PageCount | 9 |
| ParticipantIDs | proquest_miscellaneous_1718954168 proquest_journals_1689804596 crossref_citationtrail_10_1134_S0965542515060068 crossref_primary_10_1134_S0965542515060068 springer_journals_10_1134_S0965542515060068 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-06-01 |
| PublicationDateYYYYMMDD | 2015-06-01 |
| PublicationDate_xml | – month: 06 year: 2015 text: 2015-06-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Moscow |
| PublicationPlace_xml | – name: Moscow |
| PublicationTitle | Computational mathematics and mathematical physics |
| PublicationTitleAbbrev | Comput. Math. and Math. Phys |
| PublicationYear | 2015 |
| Publisher | Pleiades Publishing Springer Nature B.V |
| Publisher_xml | – name: Pleiades Publishing – name: Springer Nature B.V |
| References | Kel’manov, Khamidullin (CR13) 2001; 41 Aloise, Deshpande, Hansen, Popat (CR6) 2009; 75 Kel’manov (CR10) 2008; 263 Kel’manov, Khandeev (CR12) 2013; 7 Kel’manov, Pyatkin (CR1) 2008; 78 CR5 Kel’manov, Jeon (CR7) 2004; 52 Carter, Agol (CR8) 2012; 337 CR11 Anil, Jain (CR4) 2010; 31 Kel’manov, Pyatkin (CR2) 2009; 49 Kel’manov, Romanchenko (CR14) 2012; 6 Kel’manov, Pyatkin (CR3) 2013; 7 (CR9) 2013; 765 D. Aloise (33_CR6) 2009; 75 33_CR5 A. V. Kel’manov (33_CR10) 2008; 263 A. V. Kel’manov (33_CR12) 2013; 7 A. V. Kel’manov (33_CR2) 2009; 49 A. V. Kel’manov (33_CR13) 2001; 41 33_CR11 A. V. Kel’manov (33_CR14) 2012; 6 A. V. Kel’manov (33_CR1) 2008; 78 K. Anil (33_CR4) 2010; 31 J. A. Carter (33_CR8) 2012; 337 A. V. Kel’manov (33_CR7) 2004; 52 (33_CR9) 2013; 765 A. V. Kel’manov (33_CR3) 2013; 7 |
| References_xml | – volume: 78 start-page: 574 issue: 1 year: 2008 end-page: 575 ident: CR1 article-title: On the complexity of a search for a subset of “similar” vectors publication-title: Dokl. Math doi: 10.1134/S1064562408040273 – volume: 49 start-page: 1966 issue: 11 year: 2009 end-page: 1971 ident: CR2 article-title: Complexity of certain problems of searching for subsets of vectors and cluster analysis publication-title: Comput. Math. Math. Phys. doi: 10.1134/S0965542509110128 – volume: 337 start-page: 556 issue: 6094 year: 2012 end-page: 559 ident: CR8 article-title: Kepler-36: A pair of planets with neighboring orbits and dissimilar densities publication-title: Science doi: 10.1126/science.1223269 – volume: 75 start-page: 245 issue: 2 year: 2009 end-page: 248 ident: CR6 article-title: NP-hardness of Euclidean sum-of-squares clustering publication-title: Machine Learning doi: 10.1007/s10994-009-5103-0 – volume: 263 start-page: S84 issue: 2 year: 2008 end-page: S92 ident: CR10 article-title: Off-line detection of a quasi-periodically recurring fragment in a numerical sequence publication-title: Proc. Steklov Inst. Math. doi: 10.1134/S0081543808060096 – volume: 31 start-page: 651 year: 2010 end-page: 666 ident: CR4 article-title: Data clustering: 50 years beyond -means publication-title: Pattern Recogn. Lett. doi: 10.1016/j.patrec.2009.09.011 – volume: 7 start-page: 515 issue: 4 year: 2013 end-page: 521 ident: CR12 article-title: A 2-approximation polynomial algorithm for a clustering problem publication-title: J. Appl. Ind. Math. doi: 10.1134/S1990478913040066 – volume: 52 start-page: 645 issue: 3 year: 2004 end-page: 656 ident: CR7 article-title: A posteriori joint detection and discrimination of pulses in a quasiperiodic pulse train publication-title: IEEE Trans. Signal Processing doi: 10.1109/TSP.2003.822285 – volume: 6 start-page: 90 issue: 1 year: 2012 end-page: 96 ident: CR14 article-title: An approximation algorithm for solving a problem of search for a vector subset publication-title: J. Appl. Ind. Math. doi: 10.1134/S1990478912010097 – ident: CR11 – volume: 41 start-page: 762 issue: 5 year: 2001 end-page: 774 ident: CR13 article-title: Posterior detection of a given number of identical subsequences in a quasi-periodic sequence publication-title: Comput. Math. Math. Phys. – volume: 765 issue: 2 year: 2013 ident: CR9 publication-title: Astrophys. J. – ident: CR5 – volume: 7 start-page: 363 issue: 3 year: 2013 end-page: 369 ident: CR3 article-title: On complexity of some problems of cluster analysis of vector sequences publication-title: J. Appl. Ind. Math. doi: 10.1134/S1990478913030095 – volume: 7 start-page: 515 issue: 4 year: 2013 ident: 33_CR12 publication-title: J. Appl. Ind. Math. doi: 10.1134/S1990478913040066 – volume: 41 start-page: 762 issue: 5 year: 2001 ident: 33_CR13 publication-title: Comput. Math. Math. Phys. – ident: 33_CR5 doi: 10.1007/978-0-387-21606-5 – volume: 6 start-page: 90 issue: 1 year: 2012 ident: 33_CR14 publication-title: J. Appl. Ind. Math. doi: 10.1134/S1990478912010097 – volume: 78 start-page: 574 issue: 1 year: 2008 ident: 33_CR1 publication-title: Dokl. Math doi: 10.1134/S1064562408040273 – volume: 337 start-page: 556 issue: 6094 year: 2012 ident: 33_CR8 publication-title: Science doi: 10.1126/science.1223269 – volume: 263 start-page: S84 issue: 2 year: 2008 ident: 33_CR10 publication-title: Proc. Steklov Inst. Math. doi: 10.1134/S0081543808060096 – volume: 7 start-page: 363 issue: 3 year: 2013 ident: 33_CR3 publication-title: J. Appl. Ind. Math. doi: 10.1134/S1990478913030095 – volume: 765 issue: 2 year: 2013 ident: 33_CR9 publication-title: Astrophys. J. – volume: 52 start-page: 645 issue: 3 year: 2004 ident: 33_CR7 publication-title: IEEE Trans. Signal Processing doi: 10.1109/TSP.2003.822285 – ident: 33_CR11 – volume: 31 start-page: 651 year: 2010 ident: 33_CR4 publication-title: Pattern Recogn. Lett. doi: 10.1016/j.patrec.2009.09.011 – volume: 75 start-page: 245 issue: 2 year: 2009 ident: 33_CR6 publication-title: Machine Learning doi: 10.1007/s10994-009-5103-0 – volume: 49 start-page: 1966 issue: 11 year: 2009 ident: 33_CR2 publication-title: Comput. Math. Math. Phys. doi: 10.1134/S0965542509110128 |
| SSID | ssj0016983 |
| Score | 2.0159795 |
| Snippet | We consider a strongly NP-hard problem of partitioning a finite sequence of vectors in Euclidean space into two clusters using the criterion of the minimal sum... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1068 |
| SubjectTerms | Algorithms Approximation Clustering Clusters Computational mathematics Computational Mathematics and Numerical Analysis Euclidean geometry Euclidean space Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Optimization Polynomials Sequences Studies Vectors (mathematics) |
| SummonAdditionalLinks | – databaseName: Science Database dbid: M2P link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3JTsMwELXYDlzYEWWTkTiBrCaxndgnhBAVBzYJkHqLHNuBSiEttEXw94wTp1QguHB1vMQeL2884zcIHUoVZjY2kgC2VoRxaonglduOMnkirQht9VD4Mrm-Ft2uvPUXbkPvVtnsidVGbfra3ZG3w1hIAfhDxieDF-KiRjnrqg-hMYvmAdmEzqXrKrqdWBFiWdNwypgTDpPTWzVDytp3LtGlVQx7gWNanT6XvsDmN_todex0lv_7wytoyQNOfFrPkFU0Y8s1tOzBJ_ZLe7iObk5LXBGMv_fq14x40C8-3KNlVRAXgR6r4hHqHz09YwC6WOHGCxtnPaKLsWNcgC5gH6JmAz10zu_PLoiPtkA0ZXJElMxzqgMrjWY0F5Ll2oooCU2QKyNB61OxiQKu84BZYTLGWWhg5DJQISMhbEQ30VzZL-0WwpQmimsFmkueMM15BtK3kgL00RI22KCFgmasU-2pyF1EjCKtVBLK0h_iaaGjSZFBzcPxV-bdRiSpX5LD9EseLXQw-QyLyVlIVGn7Y8gDJ7WEjrkqjhvBT1XxW4Pbfze4gxYBZ_Haw2wXzY1ex3YPLei3UW_4ul_N2U-CC-9i priority: 102 providerName: ProQuest |
| Title | An approximation polynomial-time algorithm for a sequence bi-clustering problem |
| URI | https://link.springer.com/article/10.1134/S0965542515060068 https://www.proquest.com/docview/1689804596 https://www.proquest.com/docview/1718954168 |
| Volume | 55 |
| WOSCitedRecordID | wos000356505400013&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: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1555-6662 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0016983 issn: 0965-5425 databaseCode: 7WY dateStart: 20060101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1555-6662 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0016983 issn: 0965-5425 databaseCode: M0C dateStart: 20060101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1555-6662 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0016983 issn: 0965-5425 databaseCode: P5Z dateStart: 20060101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1555-6662 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0016983 issn: 0965-5425 databaseCode: K7- dateStart: 20060101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1555-6662 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0016983 issn: 0965-5425 databaseCode: M7S dateStart: 20060101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1555-6662 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0016983 issn: 0965-5425 databaseCode: BENPR dateStart: 20060101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 1555-6662 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0016983 issn: 0965-5425 databaseCode: M2P dateStart: 20060101 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1555-6662 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0016983 issn: 0965-5425 databaseCode: RSV dateStart: 20060101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9MwED-xjwd42GAw0TEqI-0JZC2J7cR-HNMmJFipVja2vUSO40ClLJ2adoL_nnPilMFg0vZyUpSL44-zfae7-x3AjtJhZuNcUdStNeWCWSpFE7aj8yJRVoa2SRT-lAwG8uxMDX0ed91Fu3cuyeakbuuO8N2RwykRKGINJl4QyyVYwdtOunoNx6PThesgVi32JnJTx-5dmf9s4s_L6LeG-ZdTtLlrDtcf1MunsOZVS7LXysIzeGSrDVj3aibxm7jegCdHC6jW-jl83qtIAyz-Y9xmMZKrSfnTJSvrkrrK80SX3ybT8ez7JUEFl2jSRV-TbExNOXdIC9hD4kvTvICTw4Mv-x-or7JADeNqRrUqCmYCq3LDWSEVL4yVURLmQaFzhdaejvMoEKYIuJV5xgUPcxxZhqZjJKWN2CYsV5PKvgTCWKKF0WixFAk3QmS46lYxVHmMwoM16EHQTXdqPAS5q4RRpo0pwnh6a_p68HbxyVWLv3EX83a3hqnfinUaxhKFhAsV9-DN4jVuIucZ0ZWdzJEHb2iFA3NNvOvW9UYT__vh1r24X8FjVLdEG2i2Dcuz6dy-hlVzPRvX0z4sJV_P-7Dy_mAwPManjwlFehTsOxoNHU1GSIfiot9I_C8KZ-_M |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB4hWqm9AH2JbWnrSu2lyCKJ7cQ-VNWKFoHYbpEKErfUsR1YKWS3bBa6f4rfyDiPBbUqNw69Ookt2-PxN5mZbwDeKx1mLraKIrbWlAvmqBR12I62eaKcDF2dKDxIhkN5fKwOluCqy4XxYZWdTqwVtR0b_498K4ylkog_VPx58ov6qlHeu9qV0GjEYt_NL9Fkm37a-4L7-yGKdr4ebu_StqoANYyrimqV58wETlnDWS4Vz42TURLaINdWoXWjYxsFwuQBd9JmXPDQIirI0FSKpHSe6ABV_gPumcV8qGB0sPBaxKqh_VSxoAIPQ-tFDRnf-uEbfVvN6Bd4Ztfb9-ANuP3DH1tfczur_9sCrcFKC6hJvzkBT2DJlU9htQXXpFVd02fwvV-SmkD996jJ1iSTcTH3Sdm6oNXozBFdnOB8qtMzgkCeaNJFmZNsRE0x84wSuGSkLcHzHI7uZVovYLkcl24dCGOJFkajZZYn3AiRoXQ7xRDaGYUXSNCDoNvb1LRU677iR5HWJhfj6V_i0IOPi08mDc_IXS9vdCKQtipnmt7sfw_eLR6jsvAeIF268QzfQSSicGK-i81O0G518a8BX9494Ft4tHv4bZAO9ob7r-AxYkrRRNNtwHJ1PnOv4aG5qEbT8zf1eSHw877l7xryIkyz |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB6VFiE4UChFLLRgJE4gq8naTuxjBayKKEulAuotcvxoVwrZ1SaL4N8zTpwFWkBCnDOZ-DGOv9HMfAPwTOm0dJlVFLG1plwwR6Xo0na09blyMnVdofBxPp3KszN1EvucNkO2-xCS7GsaAktT3R4srI89SPjBaeAsEWhuHT9ekslrsMVDHn1w108_rcMImep5OFGaBvEY1vytil8vph9o81KAtLt3Jtv_PeI7cDtCTnLY28hd2HD1DmxH-Eni4W524Na7NYVrcw_eH9akIxz_OuurG8liXn0LRcy6oqEjPdHV-Xw5ay8-EwS-RJMhK5uUM2qqVWBgwNGS2LJmFz5OXn94eURj9wVqGFct1cp7ZhKnrOHMS8W9cXKcpzbx2ir0AnVmx4kwPuFO2pILnlqcWYku5VhKN2b3YbOe1-4BEMZyLYxGT8bn3AhRojU4xRAKGYU_3GQEybD0hYnU5KFDRlV0LgrjxZXlG8Hz9SuLnpfjb8J7w34W8Yg2RZpJJRHQqmwET9eP8XCFiImu3XyFMnhzK5xYUPFi2OOfVPzpgw__SfoJ3Dh5NSmO30zfPoKbiMhEn4u2B5vtcuX24br50s6a5ePOuL8DTMD0WQ |
| 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=An+approximation+polynomial-time+algorithm+for+a+sequence+bi-clustering+problem&rft.jtitle=Computational+mathematics+and+mathematical+physics&rft.au=Kel%E2%80%99manov%2C+A.+V.&rft.au=Khamidullin%2C+S.+A.&rft.date=2015-06-01&rft.pub=Pleiades+Publishing&rft.issn=0965-5425&rft.eissn=1555-6662&rft.volume=55&rft.issue=6&rft.spage=1068&rft.epage=1076&rft_id=info:doi/10.1134%2FS0965542515060068&rft.externalDocID=10_1134_S0965542515060068 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0965-5425&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0965-5425&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0965-5425&client=summon |