BOOK-CHAPTER
Efficient Web Service Composition via Knapsack-Variant Algorithm
Shi-Liang FanYu-Bin YangXiao-Xuan Wang
Year: 2018 Lecture notes in computer science Pages: 51-66 Publisher: Springer Science+Business Media
Keywords:
Knapsack problem Computer science Web service Service composition Algorithm Graph The Internet Service (business) Composition (language) Theoretical computer science Database World Wide Web
Metrics
14
Cited By
4.23
FWCI (Field Weighted Citation Impact)
15
Refs
0.95
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Service-Oriented Architecture and Web Services
Physical Sciences → Computer Science → Information Systems
Web Data Mining and Analysis
Physical Sciences → Computer Science → Information Systems
Caching and Content Delivery
Physical Sciences → Computer Science → Computer Networks and Communications
Related Documents
JOURNAL ARTICLE
Efficient algorithm for replanning web service composition
Kavita D. HanabarattiRudragoud Patil
Journal: Indonesian Journal of Electrical Engineering and Computer Science Year: 2023 Vol: 31 (1)Pages: 491-491
JOURNAL ARTICLE
An Efficient Algorithm for Strategy-Proof Service Composition
Year: 2013 Vol: 4273 Pages: 105-112
JOURNAL ARTICLE
A Variant of Knapsack Problem Efficient for Benders Decomposition
Kosuke ArataniMasakazu Muramatsu
Year: 2022 Vol: 3 Pages: 152-157
JOURNAL ARTICLE
An Efficient Algorithm for the Knapsack Sharing Problem
Mhand HifiSlim SadfiAbdelkader Sbihi
Journal: Computational Optimization and Applications Year: 2002 Vol: 23 (1)Pages: 27-45
JOURNAL ARTICLE
An efficient algorithm for the collapsing knapsack problem
Jian WuThambipillai Srikanthan
Journal: Information Sciences Year: 2005 Vol: 176 (12)Pages: 1739-1751