Pages that link to "Item:Q4999425"
From MaRDI portal
The following pages link to Reducibility among Combinatorial Problems (Q4999425):
Displaying 50 items.
- Breakout local search for maximum clique problems (Q339563) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Alternating paths and cycles of minimum length (Q340546) (← links)
- On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
- The constrained shortest path tour problem (Q342457) (← links)
- Algorithmic aspects of open neighborhood location-domination in graphs (Q344871) (← links)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance (Q351554) (← links)
- The three-dimensional matching problem in kalmanson matrices (Q358634) (← links)
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- Compact DSOP and partial DSOP forms (Q385501) (← links)
- Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
- Approximation algorithms for orienting mixed graphs (Q390889) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence (Q394539) (← links)
- Average-case complexity of backtrack search for coloring sparse random graphs (Q394742) (← links)
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- Minimum weight Euclidean \(t\)-spanner is NP-hard (Q396666) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- A note on reverse scheduling with maximum lateness objective (Q398863) (← links)
- Erratum to: ``Minimizing total tardiness on parallel machines with preemptions'' (Q398871) (← links)
- On judicious bisections of graphs (Q402590) (← links)
- The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
- NP-hardness of the Euclidean Max-Cut problem (Q471386) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- The first international nurse rostering competition 2010 (Q475197) (← links)
- Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
- The complexity of the empire colouring problem (Q476435) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- Computing on binary strings (Q476852) (← links)
- Degree diameter problem on honeycomb networks (Q477344) (← links)
- On the maximum acyclic subgraph problem under disjunctive constraints (Q477599) (← links)
- The decycling number of generalized Petersen graphs (Q479058) (← links)
- Computational complexity analysis of the sensor location flow observability problem (Q479256) (← links)
- 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)
