Cited By
View all- Zhao YLiao CLin TYin JDo NHsu CVenkatasubramanian N(2015)SmartSourceProceedings of the 2015 16th IEEE International Conference on Mobile Data Management - Volume 0110.1109/MDM.2015.73(145-156)Online publication date: 15-Jun-2015
An approximation algorithm of orienteering problems for mobile computing
Pages 531 - 532
Abstract
No abstract available.
References
[1]
K. Lai and M. Goemans. The knapsack problem and fully polynomial time approximation schemes (FPTAS). http://math.mit.edu/ goemans/18434S06/knapsack-katherine.pdf, 2006.
[2]
C. Liao and C. Hsu. Detour planning algorithm in crowdsourcing systems for multimedia content gathering. In Proc. of ACM MoVid'13.
[3]
P. Vansteenwegena, W. Souffriaua, and D. Oudheusden. The orienteering problem: A survey. European Journal of Operational Research, 2011.
Index Terms
- An approximation algorithm of orienteering problems for mobile computing
Recommendations
Approximation algorithms for the arc orienteering problem
In this article we present approximation algorithms for the Arc Orienteering Problem (AOP). We propose a polylogarithmic approximation algorithm in directed graphs, while in undirected graphs we give a ( 6 + + o ( 1 ) ) and a ( 4 + ) -approximation ...
A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
In the weighted set-cover problem we are given a set of elements $E=\{ e_1,e_2, \ldots ,e_n \}$ and a collection $\cal F$ of subsets of $E$, where each $S \in \cal F$ has a positive cost $c_{S}$. The problem is to compute a subcollection $SOL$ such that ...
A Constant Factor Approximation Algorithm for the Storage Allocation Problem
We study the storage allocation problem (SAP) which is a variant of the unsplittable flow problem on paths (UFPP). A SAP instance consists of a path $$P = (V,E)$$P=(V,E) and a set J of tasks. Each edge $$e \in E$$e E has a capacity $$c_e$$ce and each ...
Comments
Information & Contributors
Information
Published In
June 2013
568 pages
ISBN:9781450316729
DOI:10.1145/2462456
- General Chairs:
- Hao-Hua Chu,
- Polly Huang,
- Program Chairs:
- Romit Roy Choudhury,
- Feng Zhao
Copyright © 2013 Copyright is held by the owner/author(s).
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 25 June 2013
Check for updates
Author Tags
Qualifiers
- Poster
Conference
MobiSys'13
Sponsor:
MobiSys'13: The 11th Annual International Conference on Mobile Systems, Applications, and Services
June 25 - 28, 2013
Taipei, Taiwan
Acceptance Rates
MobiSys '13 Paper Acceptance Rate 33 of 211 submissions, 16%;
Overall Acceptance Rate 274 of 1,679 submissions, 16%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 152Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Reflects downloads up to 14 Sep 2024
Other Metrics
Citations
Cited By
View all- Zhao YLiao CLin TYin JDo NHsu CVenkatasubramanian N(2015)SmartSourceProceedings of the 2015 16th IEEE International Conference on Mobile Data Management - Volume 0110.1109/MDM.2015.73(145-156)Online publication date: 15-Jun-2015
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in