An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A constant-factor approximation for the k-MST problem in the plane
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A constant-factor approximation algorithm for the k MST problem (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A 2.5-factor approximation algorithm for the k-MST problem
Information Processing Letters
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
A Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane
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
Paths, Trees, and Minimum Latency Tours
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Approximation Algorithms for Orienteering and Discounted-Reward TSP
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A Recursive Greedy Algorithm for Walks in Directed Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximating the k-multicut problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A general approach for incremental approximation and hierarchical clustering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Near-optimal sensor placements: maximizing information while minimizing communication cost
Proceedings of the 5th international conference on Information processing in sensor networks
Approximating the k-traveling repairman problem with repairtimes
Journal of Discrete Algorithms
Survivable network design with degree or order constraints
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximate k-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Improved algorithms for orienteering and related problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The online Prize-Collecting Traveling Salesman Problem
Information Processing Letters
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Improved approximating algorithms for Directed Steiner Forest
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Bicriteria approximation tradeoff for the node-cost budget problem
ACM Transactions on Algorithms (TALG)
An approximation algorithm to the k-Steiner Forest problem
Theoretical Computer Science
Obtaining optimal k-cardinality trees fast
Journal of Experimental Algorithmics (JEA)
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Efficient informative sensing using multiple robots
Journal of Artificial Intelligence Research
Approximating the minimum quadratic assignment problems
ACM Transactions on Algorithms (TALG)
ACM Transactions on Algorithms (TALG)
An approximation algorithm to the k-Steiner forest problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
ESA'07 Proceedings of the 15th annual European conference on Algorithms
QoS-based manycasting over optical burst-switched (OBS) networks
IEEE/ACM Transactions on Networking (TON)
Online network design with outliers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Thresholded covering algorithms for robust and max-min optimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Robust sensor placements at informative and communication-efficient locations
ACM Transactions on Sensor Networks (TOSN)
Capacitated vehicle routing with non-uniform speeds
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Resource allocation for covering time varying demands
ESA'11 Proceedings of the 19th European conference on Algorithms
Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems
ACM Transactions on Algorithms (TALG)
Improved approximation algorithms for Directed Steiner Forest
Journal of Computer and System Sciences
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
SIAM Journal on Computing
Approximating fault-tolerant group-Steiner problems
Theoretical Computer Science
Euclidean prize-collecting steiner forest
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Prize-collecting Steiner problems on planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximating buy-at-bulk and shallow-light k-Steiner trees
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Improved approximations for buy-at-bulk and shallow-light k-steiner trees and (k,2)-subgraph
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Improved algorithms for orienteering and related problems
ACM Transactions on Algorithms (TALG)
On finding minimum cost tree for multi-resource manycast in mesh networks
Optical Switching and Networking
Physical search problems with probabilistic knowledge
Artificial Intelligence
Improved approximation algorithms for (budgeted) node-weighted steiner problems
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We present a polynomial time 2-approximation algorithm for the problem of finding the minimum tree that spans at least k vertices. Our result also leads to a 2-approximation algorithm for finding the minimum tour that visits k vertices and to a 3-approximation algorithm for the problem of finding the maximum number of vertices that can be spanned by a tree of length at most a given bound.