Label placement by maximum independent set in rectangles
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
Journal of the ACM (JACM)
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
SIAM Journal on Discrete Mathematics
Improved approximation algorithms for rectangle tiling and packing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Maximizing the Number of Connections in Optical Tree Networks
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
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
Off-Line and On-Line Call-Scheduling in Stars and Trees
WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
Throughput-competitive on-line routing
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Analysis of Data Structures for Admission Control of Advance Reservation Requests
IEEE Transactions on Knowledge and Data Engineering
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Independent set of intersection graphs of convex objects in 2D
Computational Geometry: Theory and Applications
Scheduling bulk file transfers with start and end times
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Maximum independent set of rectangles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A Novel Approximate Algorithm for Admission Control
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Independent set of intersection graphs of convex objects in 2D
Computational Geometry: Theory and Applications
Coloring and maximum independent set of rectangles
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Off-line admission control for advance reservations in star networks
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
The provisioning of quality-of-service (QoS) for real-time network applications may require the network to reserve resources. A natural way to do this is to allow advance reservations of network resources prior to the time they are needed. We consider several two-dimensional admission control problems in simple topologies such as a line, a ring and a tree. The input is a set of connection requests, each specifying its spatial characteristics, that is, its source and destination; its temporal characteristics, that is, its start time and duration time; and, potentially, also a bandwidth requirement. In addition, each request has a profit gained by acommodating it. We address the related admission control problem, where the goal is to maximize the total profit gained by the accommodated requests. We provide approximation algorithms for several problem variations. Our results imply a 4c-approximation algorithm for finding a maximum weight independent set of axis-parallel rectangles in the plane, where c is the size of a maximum set of overlapping requests.