Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence
We consider some poorly studied NP-hard partitioning problems. The paper purpose is to present a short survey on some new results on efficient algorithms with performance guarantees for their solutions.
Uloženo v:
| Vydáno v: | 2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON) s. 87 - 90 |
|---|---|
| Hlavní autor: | |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina japonština |
| Vydáno: |
IEEE
01.09.2017
|
| Témata: | |
| 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 | We consider some poorly studied NP-hard partitioning problems. The paper purpose is to present a short survey on some new results on efficient algorithms with performance guarantees for their solutions. |
|---|---|
| AbstractList | We consider some poorly studied NP-hard partitioning problems. The paper purpose is to present a short survey on some new results on efficient algorithms with performance guarantees for their solutions. |
| Author | Kel'manov, Alexander |
| Author_xml | – sequence: 1 givenname: Alexander surname: Kel'manov fullname: Kel'manov, Alexander email: kelm@math.nsc.ru organization: Sobolev Inst. of Math., Novosibirsk State Univ., Novosibirsk, Russia |
| BookMark | eNotj81OwzAQhI0EB1p4AoTkF0iw4zhxjhAViFS1iJ9ztbHXraXEDk6Q4O1JoafZmd0d6VuQcx88EnLLWco5q-7emofmtd5u0ozxMlVzpHJxRhZcClVwWRXlJYGVtU479BOFYYjh2_UwueApdPsQ3XToR2pDpGPokW5ekgNEQ-e7tsN5EywdIE7u-OH8ngIdcS7y5m_6_EKv8YpcWOhGvD7pknw8rt7r52S9fWrq-3XiuCymROW6FYhGYK4rpi0yY6xVjAkspASOHDCrrABjc42VYNxkUApzNGWbF2JJbv57HSLuhjiDxJ_diVr8AsT6VNo |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/SIBIRCON.2017.8109843 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 1538615967 9781538615966 9781538615959 1538615959 |
| EndPage | 90 |
| ExternalDocumentID | 8109843 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i156t-84cb3eed3e4c90cfe0ddff8003e655a1e1ae29f3adf4ce9301d2a73d4ce97b463 |
| IEDL.DBID | RIE |
| IngestDate | Thu Jun 29 18:37:30 EDT 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English Japanese |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i156t-84cb3eed3e4c90cfe0ddff8003e655a1e1ae29f3adf4ce9301d2a73d4ce97b463 |
| PageCount | 4 |
| ParticipantIDs | ieee_primary_8109843 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-09 |
| PublicationDateYYYYMMDD | 2017-09-01 |
| PublicationDate_xml | – month: 09 year: 2017 text: 2017-09 |
| PublicationDecade | 2010 |
| PublicationTitle | 2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON) |
| PublicationTitleAbbrev | SIBIRCON |
| PublicationYear | 2017 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.6322525 |
| Snippet | We consider some poorly studied NP-hard partitioning problems. The paper purpose is to present a short survey on some new results on efficient algorithms with... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 87 |
| SubjectTerms | Algorithm design and analysis Approximation algorithms Clustering algorithms Data analysis efficient algorithms with performance guarantees NP-hard problem NP-hardness partitioning Partitioning algorithms Time complexity |
| Title | Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence |
| URI | https://ieeexplore.ieee.org/document/8109843 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5t8eBJpRXf5ODRtLtNdrO5WlosyFp80VvJJhMt2N3S3Yo_3yS7VAQv3vJOyCTMTDLfDELXmkdDLhMgSmSMsCxgJNNRQoxl1dJolsU-NuDrPU_TZD4Xsxa62WFhAMAbn0HfJf1fvi7U1j2VDZIwEAmjbdTmPK6xWg0ox1YMnqa308fRQ-rstXi_afsraIrnGZOD_812iHo_4Ds827GVI9SCvIvk2Lt6sB2w9wL-tawhh1h-vBVWv39fldiKn7gsVoDTGXFYKtwEiylxYfDaHZHm8RVLXIIdKNc-VdtS99DLZPw8uiNNdASytDpXRRKmMmqXQoEpESgDgdbGWPmPQhxFMoRQwlAYKrVhCoS9yHooOdUuwzMW02PUyYscThAOQwMm4jqQVjoS2gimmKVRaMUFCknET1HXbc9iXTvAWDQ7c_Z38TnadxSoDbEuUKfabOES7anPallurjzVvgGdiZ0k |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFG8QTfSkBozf9uDR4kY7ul4lEIg4iaLhRrr2VUmEEQbGP9-2WzAmXry13fqRvjbvtX2_90PoWvOoyWUMRImUEZYGjKQ6iomxqloazdKW5wZ8HfAkicdjMaygmw0WBgC88xk0XNK_5etMrd1V2W0cBiJmdAttO-asEq1VwnLsp9vn_l3_qf2YOI8t3ij__kWb4rVGd_9__R2g-g_8Dg83iuUQVWBeQ7Ljgz3YCtjHAf-aFqBDLD_eMnvCf5_l2BqgOM9mgJMhcWgqXNLF5DgzeOEWSXn9iiXOwTY01z5VeFPX0Uu3M2r3SMmPQKb21LUiMVMptUOhwJQIlIFAa2OsBUihFUUyhFBCUxgqtWEKhN3Kuik51S7DU9aiR6g6z-ZwjHAYGjAR14G09pHQRjDFrJRCazBQiCN-gmpueiaLIgTGpJyZ07-Lr9Bub_QwmAz6yf0Z2nPSKNyyzlF1tVzDBdpRn6tpvrz0EvwG-KigbQ |
| 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%3Abook&rft.genre=proceeding&rft.title=2017+International+Multi-Conference+on+Engineering%2C+Computer+and+Information+Sciences+%28SIBIRCON%29&rft.atitle=Efficient+approximation+algorithms+for+some+NP-hard+problems+of+partitioning+a+set+and+a+sequence&rft.au=Kel%27manov%2C+Alexander&rft.date=2017-09-01&rft.pub=IEEE&rft.spage=87&rft.epage=90&rft_id=info:doi/10.1109%2FSIBIRCON.2017.8109843&rft.externalDocID=8109843 |