Optimal orientations of cells in slicing floorplan designs
Information and Control
Computational geometry: an introduction
Computational geometry: an introduction
The discrete p-maxian location problem
Computers and Operations Research
The maximal dispersion problem and the “first point outside the neighbourhood” heuristic
Computers and Operations Research
Obnoxious facility location on graphs
SIAM Journal on Discrete Mathematics
Finding subsets maximizing minimum structures
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Approximation algorithms for maximum dispersion
Operations Research Letters
Powers of Geometric Intersection Graphs and Dispersion Algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Efficient Dispersion Algorithms for Geometric Intersection Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
In this paper we consider a special case of the Maximum Weighted Independent Set problem for graphs: given a vertex- and edge-weighted tree Τ = (V, E) where |V| = n, and a real number b, determine the largest weighted subset P of V such that the distance between the two closest elements of P is at least b. We present an O(n log3 n) algorithm for this problem when the vertices have unequal weights. The space requirement is O(n log n). This is the first known subquadratic algorithm for the problem. This solution leads to an O(n log4 n) algorithm to the previously-studied Weighted Max-Min Dispersion Problem.