Min–max tree covers of graphs
Uloženo v:
| Vydáno v: | Operations research letters Ročník 32; číslo 4; s. 309 - 315 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
01.07.2004
|
| ISSN: | 0167-6377 |
| 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!
|
| Author | Even, G. Garg, N. Ravi, R. Sinha, A. Könemann, J. |
|---|---|
| Author_xml | – sequence: 1 givenname: G. surname: Even fullname: Even, G. – sequence: 2 givenname: N. surname: Garg fullname: Garg, N. – sequence: 3 givenname: J. surname: Könemann fullname: Könemann, J. – sequence: 4 givenname: R. surname: Ravi fullname: Ravi, R. – sequence: 5 givenname: A. surname: Sinha fullname: Sinha, A. |
| BookMark | eNp9j8tKxDAYRrMYwZnRB3BlX6D1_9M0l6UM3mDEja5D2iTa0mmGpIjufAff0Ccxg65cuPrgg3PgrMhiCpMj5AyhQkB-MVQhjhUFqCvEChAWZJl_UfJaiGOySmkAACFRLsn5fT99fXzuzFsxR-eKLry6mIrgi-do9i_phBx5MyZ3-rtr8nR99bi5LbcPN3eby23ZUVbPJVdWWuktR-U890I2ElkLgjGlbGMVczV3bUs9NY4qbG0DhrHWd0CzwKh6TcSPt4shpei87vrZzH2Y5mj6USPoQ5sedG7ThzaNqHNbJvEPuY_9zsT3f5hv6LRXQQ |
| CitedBy_id | crossref_primary_10_1007_s10878_021_00720_6 crossref_primary_10_1016_j_omega_2022_102816 crossref_primary_10_1007_s10878_015_9840_7 crossref_primary_10_1109_TC_2014_2329689 crossref_primary_10_1016_j_ipl_2007_06_012 crossref_primary_10_1007_s10878_025_01278_3 crossref_primary_10_1007_s10472_009_9127_8 crossref_primary_10_1109_TASE_2024_3466183 crossref_primary_10_1109_TC_2013_2295609 crossref_primary_10_1016_j_automatica_2014_11_017 crossref_primary_10_1016_j_dam_2025_05_002 crossref_primary_10_1016_j_tcs_2016_01_041 crossref_primary_10_1093_comjnl_bxac028 crossref_primary_10_1016_j_tcs_2019_05_041 crossref_primary_10_1007_s00453_012_9740_5 crossref_primary_10_1016_j_comcom_2017_03_004 crossref_primary_10_1038_srep18267 crossref_primary_10_1109_TRO_2025_3567476 crossref_primary_10_1007_s10878_009_9242_9 crossref_primary_10_1007_s10878_014_9774_5 crossref_primary_10_1016_j_orl_2018_10_002 crossref_primary_10_1109_TMC_2013_69 crossref_primary_10_3390_robotics10040122 crossref_primary_10_1016_j_tcs_2019_04_009 crossref_primary_10_1016_j_disopt_2015_01_001 crossref_primary_10_1109_TMC_2017_2689013 crossref_primary_10_1007_s10472_009_9128_7 crossref_primary_10_1145_2908737 crossref_primary_10_3390_machines12110797 crossref_primary_10_1145_2629653 crossref_primary_10_1287_moor_2016_0803 crossref_primary_10_1109_TRO_2010_2072271 crossref_primary_10_1109_ACCESS_2019_2928012 crossref_primary_10_1109_TCNS_2020_2983791 crossref_primary_10_1177_1550147717741265 crossref_primary_10_1016_j_disc_2022_112884 crossref_primary_10_1016_j_tcs_2022_08_030 crossref_primary_10_1002_nav_20434 crossref_primary_10_1007_s10878_018_0268_8 crossref_primary_10_1016_j_ejor_2020_02_035 crossref_primary_10_1145_1383369_1383381 crossref_primary_10_1002_net_21750 crossref_primary_10_1016_j_disopt_2019_03_003 crossref_primary_10_1109_LRA_2023_3306996 crossref_primary_10_1287_moor_2015_0729 crossref_primary_10_1016_j_tcs_2022_11_009 crossref_primary_10_1007_s00186_022_00807_8 crossref_primary_10_1016_j_orl_2010_02_004 crossref_primary_10_1109_TNET_2018_2815630 crossref_primary_10_1007_s10107_021_01678_3 crossref_primary_10_1016_j_ejor_2012_12_023 crossref_primary_10_1109_TNET_2020_2999630 crossref_primary_10_1016_j_procs_2023_08_224 |
| Cites_doi | 10.1006/jagm.1996.0848 10.1137/1.9780898718515 10.1137/0207017 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.orl.2003.11.010 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) |
| EndPage | 315 |
| ExternalDocumentID | 10_1016_j_orl_2003_11_010 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1OL 1RT 1~. 1~5 29N 4.4 457 4G. 4R4 5VS 7-5 71M 8P~ 9DU 9JN 9JO AAAKF AAAKG AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AATTM AAXKI AAXUO AAYWO AAYXX ABAOU ABFNM ABJNI ABMAC ABUCO ABWVN ABXDB ACDAQ ACGFS ACLOT ACNCT ACRLP ACRPL ACVFH ADBBV ADCNI ADEZE ADGUI ADIYS ADMUD ADNMO AEBSH AEIPS AEKER AENEX AEUPX AFFNX AFJKZ AFPUW AFTJW AGHFR AGQPQ AGUBO AGYEJ AHHHB AIEXJ AIGII AIGVJ AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU APLSM APXCP ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CITATION CS3 DU5 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- ROL RPZ SDF SDG SDS SES SEW SPC SPCBC SSB SSD SSW SSZ T5K TN5 WH7 WUQ XPP XSW ~G- ~HD |
| ID | FETCH-LOGICAL-c243t-69d8d8fd619ef6f785814b074499d5d94e36ebb2f2ae291bd50a44bfc02c24a93 |
| ISICitedReferencesCount | 89 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000221348000004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0167-6377 |
| IngestDate | Tue Nov 18 21:35:41 EST 2025 Sat Nov 29 02:30:12 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c243t-69d8d8fd619ef6f785814b074499d5d94e36ebb2f2ae291bd50a44bfc02c24a93 |
| PageCount | 7 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_orl_2003_11_010 crossref_primary_10_1016_j_orl_2003_11_010 |
| PublicationCentury | 2000 |
| PublicationDate | 2004-7-00 |
| PublicationDateYYYYMMDD | 2004-07-01 |
| PublicationDate_xml | – month: 07 year: 2004 text: 2004-7-00 |
| PublicationDecade | 2000 |
| PublicationTitle | Operations research letters |
| PublicationYear | 2004 |
| References | Diestel (10.1016/j.orl.2003.11.010_BIB2) 2000 10.1016/j.orl.2003.11.010_BIB3 10.1016/j.orl.2003.11.010_BIB1 10.1016/j.orl.2003.11.010_BIB8 10.1016/j.orl.2003.11.010_BIB7 Garey (10.1016/j.orl.2003.11.010_BIB5) 1979 Frederickson (10.1016/j.orl.2003.11.010_BIB4) 1978; 7 Guttmann-Beck (10.1016/j.orl.2003.11.010_BIB6) 1997; 24 |
| References_xml | – year: 2000 ident: 10.1016/j.orl.2003.11.010_BIB2 – ident: 10.1016/j.orl.2003.11.010_BIB3 – volume: 24 start-page: 266 year: 1997 ident: 10.1016/j.orl.2003.11.010_BIB6 article-title: Approximations algorithms for min–max tree partition publication-title: J. Algorithms doi: 10.1006/jagm.1996.0848 – ident: 10.1016/j.orl.2003.11.010_BIB7 – ident: 10.1016/j.orl.2003.11.010_BIB8 doi: 10.1137/1.9780898718515 – ident: 10.1016/j.orl.2003.11.010_BIB1 – volume: 7 start-page: 178 year: 1978 ident: 10.1016/j.orl.2003.11.010_BIB4 article-title: Approximation algorithms for some routing problems publication-title: SIAM J. Comput. doi: 10.1137/0207017 – year: 1979 ident: 10.1016/j.orl.2003.11.010_BIB5 |
| SSID | ssj0007818 |
| Score | 2.0012307 |
| SourceID | crossref |
| SourceType | Enrichment Source Index Database |
| StartPage | 309 |
| Title | Min–max tree covers of graphs |
| Volume | 32 |
| WOSCitedRecordID | wos000221348000004&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: ScienceDirect database issn: 0167-6377 databaseCode: AIEXJ dateStart: 19950201 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0007818 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3LTtwwFLXQwAIWCCiIV9ssWEBRRhM_EnsJFW15dKgQlWY3chJbgCAzmhnQLPsP_cN-CdeP8QQQUlmwiSInseKc6Prc6-N7EdphqdBJTjU4OTyPaV6oWHBVxpgwCfxUJcolcT3L2m3e6YhfvrzV0JYTyKqKj8ei_65QQxuAbbbOvgHu0Ck0wDmADkeAHY7_BfxPcPW9goHcybGRkhtFupFfGGZoM1QP65z0vK8GXhDnU_9c7d_aXT41vu2s0_dm0OtIJwtrh5ZTs-Z-mFbqblJ3OVy6kA9WNHDRfBJkoEGQGuKOYE9T4iuueMM5DUxOowLWCpKWqE2oxO3XfGGrXdjgptkb2CUg0jTZVL3G9Ule7GfzVVARTgRqN13owtTTJODPdO2Gu1mcMcEbaPbg-KhzEqbmjNuAbxjNZJnbCv6evUeNqNQYx-USWvSuQnTgIF5GM6paQQu1BJIraNmb5mG06_OH731An-EP-PfnL2AfGewjh33U05HDfhX9_nZ0-fVH7OtgxAWmZBSnouQl1yX4ukqnOuOMJzQH7gfeaslKQRVJVZ5jjaXCIslL1pKU5rpoYehACrKGGlWvUusowoUCRqcIl5pQxswiMAFKrTAtKE8k20CtyaC7hU8Sb2qV3HZf_dgb6Et4pO8ypLx-8-Zbbt5C89N_cRs1RoN79RHNFQ-j6-Hgk8f2EU7LV88 |
| 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=Min%E2%80%93max+tree+covers+of+graphs&rft.jtitle=Operations+research+letters&rft.au=Even%2C+G.&rft.au=Garg%2C+N.&rft.au=K%C3%B6nemann%2C+J.&rft.au=Ravi%2C+R.&rft.date=2004-07-01&rft.issn=0167-6377&rft.volume=32&rft.issue=4&rft.spage=309&rft.epage=315&rft_id=info:doi/10.1016%2Fj.orl.2003.11.010&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_orl_2003_11_010 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-6377&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-6377&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-6377&client=summon |