Approximation algorithms for NP-hard problems
Discrete Applied Mathematics
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Polynomial time approximation schemes for dense instances of NP -hard problems
Journal of Computer and System Sciences
Approximation algorithms
Algorithm Design
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Parameterized Complexity of Vertex Cover Variants
Theory of Computing Systems
A constant approximation algorithm for the densest k-subgraph problem on chordal graphs
Information Processing Letters
Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
SIAM Journal on Computing
Improved Approximation Algorithms for the Spanning Star Forest Problem
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 approximation bounds for edge dominating set in dense graphs
Theoretical Computer Science
An Improved Approximation Bound for Spanning Star Forest and Color Saving
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
ACM Transactions on Algorithms (TALG)
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
Proceedings of the forty-second ACM symposium on Theory of computing
Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
Random Structures & Algorithms
Densest k-subgraph approximation on intersection graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
The Design of Approximation Algorithms
The Design of Approximation Algorithms
PTAS for densest k-subgraph in interval graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Everywhere-Sparse Spanners via Dense Subgraphs
FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
Parameterized Complexity
Parameterized Complexity of Cardinality Constrained Optimization Problems
The Computer Journal
| Hi-index | 0.04 |
Given a node-weighted graph G=(V,E) and an integer k, the k-edge-incident subgraph problem requires one to find a vertex set S@?V of maximum weight that covers at most k edges, and the minimum partial vertex cover problem requires one to find a set of k vertices that covers the minimum number of edges. These two problems are closely related to the well-studied densestk-subgraph problem, and are interesting on their own. In this paper, we study these two problems from an approximation point of view. We obtain the following results. 1.For the k-edge-incident subgraph problem, we present a (2+@e) approximation algorithm for any fixed @e0, which improves the previous best approximation ratio of 3 and matches that of its unweighted version [O. Goldschmidt and D.S. Hochbaum, k-edge subgraph problems, Discrete Appl. Math. 74 (2) (1997) 159-169]. 2.For the minimum partial vertex cover problem, we give a 2-approximation algorithm. We then propose a polynomial-time approximation scheme (PTAS) for it on the class of everywhere-c-dense graphs on which many well-studied combinatorial problems have been investigated.