1,844 research outputs found
From Cost Sharing Mechanisms to Online Selection Problems
We consider a general class of online optimization problems, called online selection problems, where customers arrive sequentially, and one has to decide upon arrival whether to accept or reject each customer. If a customer is rejected, then a rejection cost is incurred. The accepted customers are served with minimum possible cost, either online or after all customers have arrived. The goal is to minimize the total production costs for the accepted customers plus the rejection costs for the rejected customers. These selection problems are related to online variants of offline prize collecting combinatorial optimization problems that have been widely studied in the computer science literature. In this paper, we provide a general framework to develop online algorithms for this class of selection problems. In essence, the algorithmic framework leverages any cost sharing mechanism with certain properties into a poly-logarithmic competitive online algorithm for the respective problem; the competitive ratios are shown to be near-optimal. We believe that the general and transparent connection we establish between cost sharing mechanisms and online algorithms could lead to additional online algorithms for problems beyond the ones studied in this paper.National Science Foundation (U.S.) (CAREER Award CMMI-0846554)United States. Air Force Office of Scientific Research (FA9550-11-1-0150)United States. Air Force Office of Scientific Research (FA9550-08-1-0369)Solomon Buchsbaum AT&T Research Fun
Steiner Tree Games
Prize-collecting Steiner tree is a network design problem in which a utility provider located at some position in a graph attempts to construct a network (subtree) of maximum profit based on the value of the vertices in the graph and the costs of the edges. I consider three network formation games where the players represent competing providers attempting to build networks in the same market. These games seek to preserve the key feature of Prize-Collecting Steiner tree, namely that players must each build a subtree that attempts to include customers who are of high value or are easy to reach. I analyze the price of anarchy and price of stability of each of these games
Steiner Tree Games
Prize-collecting Steiner tree is a network design problem in which a utility provider located at some position in a graph attempts to construct a network (subtree) of maximum profit based on the value of the vertices in the graph and the costs of the edges. I consider three network formation games where the players represent competing providers attempting to build networks in the same market. These games seek to preserve the key feature of Prize-Collecting Steiner tree, namely that players must each build a subtree that attempts to include customers who are of high value or are easy to reach. I analyze the price of anarchy and price of stability of each of these games
Node-Weighted Prize Collecting Steiner Tree and Applications
The Steiner Tree problem has appeared in the Karp's list of the first 21 NP-hard problems and is well known as one of the most fundamental problems in Network Design area. We study the Node-Weighted version of the Prize
Collecting Steiner Tree problem.
In this problem, we are given a simple graph with a cost and penalty value associated with each node. Our
goal is to find a subtree T of the graph minimizing the cost of the
nodes in T plus penalty of the nodes not in T. By a reduction
from set cover problem it can be easily shown that the problem cannot be approximated in polynomial time within factor of (1-o(1))ln n unless NP has quasi-polynomial time algorithms, where n is the number of vertices of the graph.
Moss and Rabani claimed an O(log n)-approximation algorithm for the problem using a Primal-Dual approach in their STOC'01 paper \cite{moss2001}. We show that their algorithm is incorrect by providing a counter example in which there is an O(n) gap between the dual solution constructed by their algorithm and the optimal solution. Further, evidence is given that their algorithm probably does not have a simple fix. We propose a new algorithm which is more involved and
introduces novel ideas in primal dual approach for network design problems. Also, our algorithm is a Lagrangian Multiplier Preserving algorithm and we show how this property can be utilized to design an O(log n)-approximation algorithm for the Node-Weighted Quota Steiner Tree problem
using the Lagrangian Relaxation method.
We also show an application of the Node Weighted Quota Steiner Tree problem in designing algorithm with better approximation factor for
Technology Diffusion problem, a problem proposed by Goldberg and Liu
in \cite{goldberg2012} (SODA 2013). In Technology Diffusion, we are given a graph G and a threshold θ(v) associated with each vertex v and we are seeking a set of initial nodes called the seed set.
Technology Diffusion is a dynamic process defined over time in which each vertex is either active or inactive. The vertices in the seed set
are initially activated and each other vertex v gets activated whenever there are at least θ(v) active nodes connected to
v through other active nodes. The Technology Diffusion problem asks to
find the minimum seed set activating all nodes. Goldberg
and Liu gave an O(rllog n)-approximation algorithm for the problem where
r and l are the diameter of G and the number of distinct threshold values, respectively. We improve the approximation factor
to O(min{r,l}log n) by establishing a close connection between the problem and the Node Weighted Quota Steiner Tree problem
2-Approximation for Prize-Collecting Steiner Forest
Approximation algorithms for the prize-collecting Steiner forest problem
(PCSF) have been a subject of research for over three decades, starting with
the seminal works of Agrawal, Klein, and Ravi and Goemans and Williamson on
Steiner forest and prize-collecting problems. In this paper, we propose and
analyze a natural deterministic algorithm for PCSF that achieves a
-approximate solution in polynomial time. This represents a significant
improvement compared to the previously best known algorithm with a
-approximation factor developed by Hajiaghayi and Jain in 2006.
Furthermore, K{\"{o}}nemann, Olver, Pashkovich, Ravi, Swamy, and Vygen have
established an integrality gap of at least for the natural LP relaxation
for PCSF. However, we surpass this gap through the utilization of a
combinatorial algorithm and a novel analysis technique. Since is the best
known approximation guarantee for Steiner forest problem, which is a special
case of PCSF, our result matches this factor and closes the gap between the
Steiner forest problem and its generalized version, PCSF
- …