Directed star packing: tractability, inapproximability, and approximation algorithms
From MaRDI portal
Cites work
- An improved approximation algorithm for the maximum weight independent set problem in d-claw free graphs
- An improved approximation algorithm for the minimum 4-star partition problem
- An improved approximation algorithm for the minimum k-star partition problem
- An improved approximation for maximum weighted \(k\)-set packing
- Approximating the k-set packing problem by local improvements
- Approximation algorithms for non-sequential star packing problems
- Approximation algorithms for non-sequential star packing problems
- Approximation algorithms for the k^+-star packing problem
- Approximation algorithms for two-machine flow-shop scheduling with a conflict graph
- Complexity of approximating bounded variants of optimization problems
- Efficient subgraphs packing
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Maximum skew-symmetric flows and matchings
- On star family packing of graphs
- On the complexity of digraph packings
- On the Complexity of General Graph Factor Problems
- Oriented star packings
- Packing 2- and 3-stars into cubic graphs
- Packing triangles in bounded degree graphs.
- Packings by cliques and by finite families of graphs
- Packings by Complete Bipartite Graphs
- Path cover problems with length cost
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
- The path partition problem and related problems in bipartite graphs
This page was built for publication: Directed star packing: tractability, inapproximability, and approximation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7406183)
