The following pages link to (Q2721980):
Displaying 17 items.
- Traveling salesman problems in temporal graphs (Q284573) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- A local search algorithm for binary maximum 2-path partitioning (Q1799391) (← links)
- Approximation algorithms for NMR spectral peak assignment. (Q1874392) (← links)
- An improved approximation algorithm for the minimum common integer partition problem (Q2051801) (← links)
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- The limits of local search for weighted \(k\)-set packing (Q2164726) (← links)
- Clique-detection models in computational biochemistry and genomics (Q2491763) (← links)
- A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs (Q2708231) (← links)
- Near Approximation of Maximum Weight Matching through Efficient Weight Reduction (Q3010385) (← links)
- Improved Parameterized Algorithms for Weighted 3-Set Packing (Q3511321) (← links)
- A randomized approximation algorithm for metric triangle packing (Q5918266) (← links)
- Approximation algorithms for the maximum-weight cycle/path packing problems (Q6542868) (← links)
- Algorithms and computational study on a transportation system integrating public transit and ridesharing of personal vehicles (Q6551138) (← links)
- Independent set in \(k\)-claw-free graphs: conditional \(\chi \)-boundedness and the power of LP/SDP relaxations (Q6574949) (← links)
- The limits of local search for weighted \(k\)-set packing (Q6589755) (← links)
- Algorithms for the ridesharing with profit constraint problem (Q6606199) (← links)
