This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results
Filter
Author / Creator / Contributor
Subject / Keyword
- 1Approximation Algorithms
- 1Envy-Free Pricing
- 1Highway Problem
- 1Randomized Algorithms
- 1Single-Minded Pricing
- 1Tollbooth Problem
Collections
Year
Languages
Item type
Departments
Supervisors
-
Approximation Algorithms for Single-Minded Pricing and Unique Coverage on Graphs and Geometric Objects
DownloadSpring 2015
We study the Single-Minded Pricing, Unique Coverage, and Uniform-Budget Single-Minded Pricing problems on graphs and on geometric objects. In Single Minded Pricing, we are given a set of items and a collection of subsets of the items, called demands. For each demand, we are also given a budget....
1 - 1 of 1