Pages that link to "Item:Q4999425"
From MaRDI portal
The following pages link to Reducibility among Combinatorial Problems (Q4999425):
Displayed 45 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)
- 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)
- A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem (Q2432914) (← 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)
- 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)
- Local Search Based on Genetic Algorithms (Q3509426) (← links)
- Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP (Q3541790) (← links)
- Minimum Time Multi-UGV Surveillance (Q3589730) (← links)
- A Note on k-Colorability of P 5-Free Graphs (Q3599143) (← links)
- Approximating Independent Set and Coloring in Random Uniform Hypergraphs (Q3599156) (← links)
- On Partial Covers, Reducts and Decision Rules (Q3600307) (← links)
- Worst-Case Analysis of Network Design Problem Heuristics (Q3964299) (← links)
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs (Q4210164) (← links)
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps (Q4210166) (← links)
- An Improved Multi-set Algorithm for the Dense Subset Sum Problem (Q5387614) (← links)
- Complexity of Project Scheduling Problem with Nonrenewable Resources (Q5391960) (← links)
- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs (Q5452161) (← links)
- Satisfiability of Algebraic Circuits over Sets of Natural Numbers (Q5458839) (← links)
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order (Q5505660) (← links)
- Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph (Q5505664) (← links)
- Helly-type theorems for approximate covering (Q5896959) (← links)
- Single-machine scheduling with a common due window (Q5926034) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- Minimizing maximum earliness on parallel identical machines (Q5926601) (← links)
- NP-hardness of compact scheduling in simplified open and flow shops. (Q5932026) (← links)
- Graph colourings and partitions (Q5941502) (← links)
- Combinatorial optimization algorithms for radio network planning (Q5941516) (← links)
- A note on distributed multicast routing in point-to-point networks (Q5945321) (← links)
- A branch-and-price algorithm for the Steiner tree packing problem. (Q5952785) (← links)