Pages that link to "Item:Q4999425"
From MaRDI portal
The following pages link to Reducibility among Combinatorial Problems (Q4999425):
Displayed 50 items.
- Bichromatic \(P_{4}\)-composition schemes for perfect orderability (Q1827860) (← links)
- Comparison of metaheuristic algorithms for examination timetabling problem (Q1885092) (← links)
- Linear time approximation schemes for vehicle scheduling problems (Q1887080) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
- On the lattices of NP-subspaces of a polynomial time vector space over a finite field (Q1923577) (← links)
- Liar's domination in graphs: complexity and algorithm (Q1949115) (← links)
- The Hamiltonian numbers in digraphs (Q1956235) (← links)
- The broadcast median problem in heterogeneous postal model (Q1956241) (← links)
- Coherence and computational complexity of quantifier-free dependence logic formulas (Q1956380) (← links)
- Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem (Q1962067) (← links)
- Minimizing functions of infeasibilities in a two-machine flow shop (Q1969868) (← links)
- Scheduling with limited machine availability (Q1969884) (← links)
- Conflict graphs in solving integer programming problems (Q1969889) (← links)
- Solving the feedback vertex set problem on undirected graphs (Q1975362) (← links)
- Heuristics for finding \(k\)-clubs in an undirected graph (Q1977620) (← links)
- An NP-completeness result of edge search in graphs (Q2014718) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
- Hardness results and approximation algorithm for total liar's domination in graphs (Q2015803) (← links)
- Time-triggered runtime verification (Q2248067) (← links)
- Lee-Yang theorems and the complexity of computing averages (Q2249768) (← links)
- Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
- Better lower and upper bounds for the minimum rainbow subgraph problem (Q2250438) (← links)
- On sorting unsigned permutations by double-cut-and-joins (Q2377380) (← links)
- A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem (Q2432914) (← links)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
- The online knapsack problem: advice and randomization (Q2437775) (← links)
- Complexity and approximation for traveling salesman problems with profits (Q2441781) (← links)
- Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
- An improved parameterized algorithm for the independent feedback vertex set problem (Q2447761) (← links)
- Phase retrieval from very few measurements (Q2447980) (← links)
- A note on graphs contraction-critical with respect to independence number (Q2449144) (← links)
- A Modica-Mortola approximation for the Steiner problem (Q2450283) (← links)
- On the computational complexity of the probabilistic traveling salesman problem with deadlines (Q2453174) (← links)
- A linear kernel for the complementary maximal strip recovery problem (Q2453554) (← links)
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound (Q2453557) (← links)
- Finding large cliques in sparse semi-random graphs by simple randomized search heuristics (Q2455599) (← links)
- Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing (Q2462555) (← links)
- Steiner diagrams and \(k\)-star hubs (Q2466026) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- On influence, stable behavior, and the most influential individuals in networks: a game-theoretic approach (Q2510117) (← links)
- Is the protein model assignment problem under linked branch lengths NP-hard? (Q2637350) (← links)
- Finding the smallest binarization of a CFG is NP-hard (Q2637648) (← links)
- Grundy number on -classes (Q2840510) (← links)
- Exploiting Symmetries in Polyhedral Computations (Q2849003) (← links)
- Turing Test as a Defining Feature of AI-Completeness (Q2866100) (← links)
- Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments (Q3077409) (← links)
- Estimation of Sparse Jacobian Matrices (Q3223806) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- On the Longest Common Parameterized Subsequence (Q3506962) (← links)