A fast approximation algorithm for the multicovering problem
Discrete Applied Mathematics
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Label placement by maximum independent set in rectangles
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
SIAM Journal on Discrete Mathematics
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
Efficient approximation algorithms for tiling and packing problems with rectangles
Journal of Algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Design and evaluation of an advance reservation protocol on top of RSVP
BC '98 Proceedings of the IFIP TC6/WG6.2 Fourth International Conference on Broadband Communications: The future of telecommunications
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
SIAM Journal on Discrete Mathematics
Off-line admission control for advance reservations in star networks
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Using fractional primal-dual to schedule split intervals with demands
Discrete Optimization
A Novel Approximate Algorithm for Admission Control
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
| Hi-index | 0.00 |
In the admission control problem we are given a network and a set of connection requests, each of which is associated with a path, a time interval, a bandwidth requirement, and a weight. A feasible schedule is a set of connection requests such that at any given time, the total bandwidth requirement on every link in the network is at most 1. Our goal is to find a feasible schedule with maximum total weight. We consider the admission control problem in two simple topologies: the line and the tree. We present a 12c-approximation algorithm for the line topology, where c is the maximum number of requests on a link at some time instance. This result implies a 12c-approximation algorithm for the rectangle packing problem, where c is the maximum number of rectangles that cover simultaneously a point in the plane. We also present an O(logt)-approximation algorithm for the tree topology, where t is the size of the tree. We consider the loss minimization version of the admission control problem in which the goal is to minimize the weight of unscheduled requests. We present a c-approximation algorithm for loss minimization problem in the tree topology. This result is based on an approximation algorithm for a generalization of set cover, in which each element has a covering requirement, and each set has a covering potential. The approximation ratio of this algorithm is @D, where @D is the maximum number of sets that contain the same element.