Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
A 2 + ε approximation algorithm for the k-MST problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The prize collecting Steiner tree problem: theory and practice
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A 3-approximation for the minimum tree spanning k vertices
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Near-optimal sensor placements: maximizing information while minimizing communication cost
Proceedings of the 5th international conference on Information processing in sensor networks
Robust sensor placements at informative and communication-efficient locations
ACM Transactions on Sensor Networks (TOSN)
Solving connected subgraph problems in wildlife conservation
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
Given an undirected graph G=(V,E), an edge cost c(e)=0 for each edge e@?E, a vertex prize p(v)=0 for each vertex v@?V, and an edge budget B. The BUDGET PRIZE COLLECTING TREE PROBLEM is to find a subtree T'=(V',E') that maximizes @?"v"@?"V"'p(v), subject to @?"e"@?"E"'c(e)=