Improved algorithms for the maximum weight star packing problem
From MaRDI portal
Cites work
- A deterministic approximation algorithm for metric triangle packing
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- An approximation algorithm for maximum packing of 3-edge paths
- An improved approximation for maximum weighted \(k\)-set packing
- Approximation algorithms for cycle and path partitions in complete graphs
- Approximation algorithms for the maximum-weight cycle/path packing problems
- Approximation results for the weighted \(P_4\) partition problem
- Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems
- Combinatorial optimization. Theory and algorithms
- Deterministic Algorithms for Submodular Maximization Problems
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 5999574 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- Improved approximation algorithms for weighted 2-path partitions
- Local search algorithms for the maximum carpool matching problem
- Maximum weight cycle packing in directed graphs, with application to kidney exchange programs
- On the Complexity of General Graph Factor Problems
- On the maximum quadratic assignment problem
This page was built for publication: Improved algorithms for the maximum weight star packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7442717)