Pages that link to "Item:Q4999425"
From MaRDI portal
The following pages link to Reducibility among Combinatorial Problems (Q4999425):
Displayed 50 items.
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← links)
- Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Exploring the tractability border in epistemic tasks (Q484931) (← links)
- The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
- Routing regardless of network stability (Q487016) (← links)
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- Weighted synergy graphs for effective team formation with heterogeneous ad hoc agents (Q490516) (← links)
- Zero forcing number, constrained matchings and strong structural controllability (Q491112) (← links)
- Bandwidth allocation in cellular networks with multiple interferences (Q494422) (← links)
- Decycling bubble sort graphs (Q494444) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
- Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
- On the nearest neighbor rule for the metric traveling salesman problem (Q496440) (← links)
- Definition and algorithms for reliable Steiner tree problem (Q498083) (← links)
- An introduction to mechanized reasoning (Q504394) (← links)
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
- Solving systems of diagonal polynomial equations over finite fields (Q507442) (← links)
- Succinctness and tractability of closure operator representations (Q507522) (← links)
- Bounds on spectrum graph coloring (Q510538) (← links)
- Anti-forcing spectra of perfect matchings of graphs (Q511717) (← links)
- Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (Q511728) (← links)
- Integer linear programming for the Bayesian network structure learning problem (Q511785) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
- An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581) (← links)
- A new property of the Lovász number and duality relations between graph parameters (Q516767) (← links)
- A column generation based algorithm for the robust graph coloring problem (Q516837) (← links)
- Mixed-integer quadratic programming is in NP (Q517303) (← links)
- The real nonnegative inverse eigenvalue problem is NP-hard (Q518113) (← links)
- Grassmann homomorphism and Hajós-type theorems (Q518115) (← links)
- On generalized hexagons of order \((3, t)\) and \((4, t)\) containing a subhexagon (Q518181) (← links)
- Hardness of computing clique number and chromatic number for Cayley graphs (Q518185) (← links)
- Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Fast local search for the maximum independent set problem (Q519101) (← links)
- Path-disruption games: bribery and a probabilistic model (Q519896) (← links)
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- On well-covered pentagonalizations of the plane (Q526819) (← links)
- Steiner trees with bounded RC-delay (Q527413) (← links)
- On the barrier graph of an arrangement of ray sensors (Q528551) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Improved results on geometric hitting set problems (Q603882) (← links)
- Hardness amplification within NP against deterministic algorithms (Q619904) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- A quadratic penalty method for hypergraph matching (Q683734) (← links)
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families (Q707142) (← links)
- A meta-heuristic approach for improving the accuracy in some classification algorithms (Q709124) (← links)