Long cycles in graphs with no subgraphs of minimal degree 3
Discrete Mathematics
Induced subgraphs of the power of a cycle
SIAM Journal on Discrete Mathematics
Discrete Mathematics
Approximating the minimum degree spanning tree to within one from the optimal degree
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
The traveling salesman problem with distances one and two
Mathematics of Operations Research
Minimum vertex weighted deficiency of (g,f)-factors: a greedy algorithm
Discrete Applied Mathematics
Approximating the minimum-degree Steiner tree to within one of optimal
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Combinatorial optimization
Approximation algorithms
Succinct Representation of Balanced Parentheses and Static Trees
SIAM Journal on Computing
The Approximation of Maximum Subgraph Problems
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Hardness of Approximating Problems on Cubic Graphs
CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Finding a Path of Superlogarithmic Length
SIAM Journal on Computing
Finding large cycles in Hamiltonian graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximation Schemes for First-Order Definable Optimisation Problems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Ruling Out PTAS for Graph Min-Bisection, Dense k-Subgraph, and Bipartite Clique
SIAM Journal on Computing
Finding Paths and Cycles of Superpolylogarithmic Length
SIAM Journal on Computing
Discrete Applied Mathematics
Hardness and approximation of traffic grooming
Theoretical Computer Science
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
Proceedings of the forty-second ACM symposium on Theory of computing
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
Journal of Discrete Algorithms
Parameterized complexity of finding small degree-constrained subgraphs
Journal of Discrete Algorithms
On approximating the d-girth of a graph
Discrete Applied Mathematics
| Hi-index | 0.04 |
In this article we provide hardness results and approximation algorithms for the following three natural degree-constrained subgraph problems, which take as input an undirected graph G=(V,E). Let d=2 be a fixed integer. The Maximumd-degree-bounded Connected Subgraph (MDBCS"d) problem takes as additional input a weight function @w:E-R^+, and asks for a subset E^'@?E such that the subgraph induced by E^' is connected, has maximum degree at most d, and @?"e"@?"E"^"'@w(e) is maximized. The Minimum Subgraph of Minimum Degree=d (MSMD"d) problem involves finding a smallest subgraph of G with minimum degree at least d. Finally, the Dual Degree-densek-Subgraph (DDDkS) problem consists in finding a subgraph H of G such that |V(H)|@?k and the minimum degree in H is maximized.