|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 16 occurrences of 14 keywords
|
|
|
Results
Found 32 publication records. Showing 32 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
193 | Chandra Chekuri, Alina Ene, Nitish Korula |
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 42-55, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
150 | Yossi Azar, Oded Regev 0001 |
Combinatorial Algorithms for the Unsplittable Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 44(1), pp. 49-66, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Unsplittable flow problem, Combinatorial algorithms |
141 | Krzysztof Walkowiak |
New Algorithms for the Unsplittable Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (2) ![In: Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part II, pp. 1101-1110, 2006, Springer, 3-540-34072-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
UFP, survivability, connection-oriented network |
107 | Yossi Azar, Oded Regev 0001 |
Strongly Polynomial Algorithms for the Unsplittable Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 15-29, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
77 | Krzysztof Walkowiak |
Unsplittable Anycast Flow Problem: Formulation and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (1) ![In: Computational Science - ICCS 2006, 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part I, pp. 618-625, 2006, Springer, 3-540-34379-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
UFP, anycast, connection-oriented network |
64 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
A Note on Multiflows and Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(3), pp. 400-412, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Product multicommodity flow, Treewidth, Edge-disjoint paths |
64 | Jian Hu, Yang-Li Xiang |
A New Fast Frequent Itemsets Mining Algorithm Based on Forest. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (2) ![In: Fifth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2008, 18-20 October 2008, Jinan, Shandong, China, Proceedings, Volume 2, pp. 551-555, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
64 | Nikhil Bansal 0001, Amit Chakrabarti, Amir Epstein, Baruch Schieber |
A quasi-PTAS for unsplittable flow on line graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 721-729, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
scheduling, approximation algorithms, resource allocation, approximation scheme, unsplittable flow |
64 | Zhanqi Xu, Chunting Wang, Changxin Pei, Aijun Wen |
A Unified Framing Protocol for Hybrid Data Transport. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2005), 5-8 December 2005, Dalian, China, pp. 210-214, 2005, IEEE Computer Society, 0-7695-2405-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
64 | Petr Kolman, Christian Scheideler |
Improved bounds for the unsplittable flow problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 184-193, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
43 | Amit Chakrabarti, Chandra Chekuri, Anupam Gupta 0001, Amit Kumar 0001 |
Approximation Algorithms for the Unsplittable Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 47(1), pp. 53-78, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Amit Chakrabarti, Chandra Chekuri, Anupam Gupta 0001, Amit Kumar 0001 |
Approximation Algorithms for the Unsplittable Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings, pp. 51-66, 2002, Springer, 3-540-44186-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Jian Gao 0001, Yaozong Zhang, Xiangrui Meng, Fang-Wei Fu 0001 |
Minimal linear codes from defining sets over Fp+uFp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(10), pp. 113584, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
31 | Hai Q. Dinh 0001, Bac Trong Nguyen, Hiep L. Thi, Woraphon Yamaka |
On Hamming Distance Distributions of Repeated-Root Cyclic Codes of Length 5ps Over Fp m + uFp m. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 10, pp. 119883-119904, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
31 | N. Annamalai |
On Zero-Divisor Graph of the ring Fp+uFp+u2 Fp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.06004, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
31 | Debajyoti Kar, Arindam Khan 0001, Andreas Wiese |
Approximation Algorithms for ROUND-UFP and ROUND-SAP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.03492, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
31 | Debajyoti Kar, Arindam Khan 0001, Andreas Wiese |
Approximation Algorithms for Round-UFP and Round-SAP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany., pp. 71:1-71:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-247-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
31 | Brandon Brown, Marcellus Smith, Sadaira Parker, Jabari Leslie, Cheryl D. Seals, Gerry V. Dozier, Michael C. King |
Adversarial UFP/UFN Attack Evolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSCI ![In: IEEE Symposium Series on Computational Intelligence, SSCI 2021, Orlando, FL, USA, December 5-7, 2021, pp. 1-7, 2021, IEEE, 978-1-7281-9048-8. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
31 | Abdullah Dertli, Yasemin Cengellenmis |
Quantum Codes Obtained from Some Constacyclic Codes Over a Family of Finite Rings Fp+uFp+vFp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 14(2), pp. 437-441, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
31 | Yansheng Wu, Jong Yoon Hyun |
Few-weight codes over Fp+uFp associated with down sets and their distance optimal Gray image. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 283, pp. 315-322, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
31 | Sergey S. Vladimirov, Vladimir M. Vishnevskii, Andrey A. Larionov, Ruslan Kirichek |
The Model of WBAN Data Acquisition Network Based on UFP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCCN ![In: Distributed Computer and Communication Networks - 23rd International Conference, DCCN 2020, Moscow, Russia, September 14-18, 2020, Revised Selected Papers, pp. 220-231, 2020, Springer, 978-3-030-66470-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
31 | Andrés Cristi, Andreas Wiese |
Better Approximations for General Caching and UFP-Cover Under Resource Augmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France., pp. 44:1-44:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-140-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
31 | Brandon Brown, Alexicia Richardson, Marcellus Smith, Gerry V. Dozier, Michael C. King |
The Adversarial UFP/UFN Attack: A New Threat to ML-based Fake News Detection Systems? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSCI ![In: 2020 IEEE Symposium Series on Computational Intelligence, SSCI 2020, Canberra, Australia, December 1-4, 2020, pp. 1523-1527, 2020, IEEE, 978-1-7281-2547-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
31 | Yansheng Wu, Jong Yoon Hyun |
Few-weight codes over Fp+uFp associated with down sets and their distance optimal Gray image. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1910.07668, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
31 | Xiying Zheng, Bo Kong |
Cyclic codes and λ1+λ2u+λ3v+λ4uv-constacyclic codes over Fp+uFp+vFp+uvFp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 306, pp. 86-91, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
31 | Reza Dastbasteh, Seyed Hamed Mousavi, Taher Abualrub, Nuh Aydin, Javad Haghighat |
Skew cyclic codes over Fp+uFp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1712.07783, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
31 | Minjia Shi, Yan Liu 0046, Patrick Solé |
Trace Codes with Few Weights over Fp+uFp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1612.00128, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
31 | Yan Liu 0046, Minjia Shi, Patrick Solé |
Two-weight and three-weight codes from trace codes over Fp+uFp+vFp+uvFp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1612.00118, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
31 | Mu Han, Youpei Ye, Shixin Zhu, Chungen Xu, Bennian Dou |
Cyclic codes over R = Fp + uFp ++ uk-1Fp with length psn. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 181(4), pp. 926-934, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
31 | Yasemin Cengellenmis |
On some special codes over Fp + uFp + u2Fp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 218(3), pp. 720-722, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
31 | Jianfa Qian, Lina Zhang, Shixin Zhu |
Cyclic Codes over Fp + uFp+ ··· +uk-1 Fp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(3), pp. 795-797, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman |
Algorithms for fault-tolerant routing in circuit switched networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002, pp. 265-274, 2002, ACM, 1-58113-529-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
flow number, greedy algorithms, fault-tolerant routing, multicommodity flow, edge-disjoint paths |
Displaying result #1 - #32 of 32 (100 per page; Change: )
|
|