Pages that link to "Item:Q2971609"
From MaRDI portal
The following pages link to Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems (Q2971609):
Displaying 9 items.
- On two-machine flow shop scheduling (Q489134) (← links)
- Greedy matching: guarantees and limitations (Q513303) (← links)
- Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph (Q764406) (← links)
- Sublinear-time algorithms for approximating graph parameters (Q2075766) (← links)
- Efficient approximation algorithms for weighted \(b\)-matching (Q2830632) (← links)
- Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs (Q3462544) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs (Q4623143) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)