ERA

Download the full-sized PDF of Approximation Algorithms for some Min-max Vehicle Routing ProblemsDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3PT1Q

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Graduate Studies and Research, Faculty of

Collections

This file is in the following collections:

Theses and Dissertations

Approximation Algorithms for some Min-max Vehicle Routing Problems Open Access

Descriptions

Other title
Subject/Keyword
Star Cover
Vehicle Routing
Approximation Algorithms
Tour Cover
Type of item
Thesis
Degree grantor
University of Alberta
Author or creator
Jorati, Amin
Supervisor and department
Salavatipour, Mohammad (Computing Science)
Examining committee member and department
Elmallah, Ehab (Computing Science)
Hayward, Ryan (Computing Science)
Department
Department of Computing Science
Specialization

Date accepted
2013-10-02T11:20:12Z
Graduation date
2013-11
Degree
Master of Science
Degree level
Master's
Abstract
In this thesis, we consider min-max vehicle routing problems, specifically min-max tour cover and star cover problems. Given a metric (V,c) and a number k, a set of tours (respectively stars) in G is called a k-tour cover (respectively k-star cover), if they cover all the vertices of G. In the rooted variant, the locations of the roots are given in the input. In Chapter 2, we improve on the approximation ratios of tour cover problems. We present algorithms that improve the approximation ratios of rooted and unrooted min-max k-tour cover problems to (7+epsilon) and (16/3+epsilon) respectively. In Chapter 3, we study the unrooted min-max k-star cover problem and improve the bi-criteria approximation ratio to (O(1/epsilon), 1+epsilon). For the line metric, we present a QPTAS, and in the special case that the stars are non-crossing, we present a PTAS. Then, we show that the problem is APX-hard on the Euclidean metric.
Language
English
DOI
doi:10.7939/R3PT1Q
Rights
Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of these terms. The author reserves all other publication and other rights in association with the copyright in the thesis and, except as herein before provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication

File Details

Date Uploaded
Date Modified
2014-05-01T00:56:39.512+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 368225
Last modified: 2015:10:12 13:28:15-06:00
Filename: Amin Jorati MSc Thesis.pdf
Original checksum: 804abe8535f2df897a1d3a7748c2e07f
Well formed: false
Valid: false
Status message: No document catalog dictionary offset=0
Activity of users you follow
User Activity Date