The following pages link to (Q4258216):
Displaying 50 items.
- Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs (Q1653049) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- Multiple facility location on a network with linear reliability order of edges (Q1680498) (← links)
- Time traps in supply chains: is optimal still good enough? (Q1681387) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (Q1699417) (← links)
- Sparsification and subexponential approximation (Q1702300) (← links)
- Minimizing worst-case and average-case makespan over scenarios (Q1702655) (← links)
- The complexity of secure domination problem in graphs (Q1708386) (← links)
- Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm (Q1718374) (← links)
- Complexity of strict robust integer minimum cost flow problems: an overview and further results (Q1725614) (← links)
- Approximate inference in Bayesian networks: parameterized complexity results (Q1726381) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Algorithmic aspects of semitotal domination in graphs (Q1731849) (← links)
- Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Tropical dominating sets in vertex-coloured graphs (Q1748204) (← links)
- On two extensions of equimatchable graphs (Q1751251) (← links)
- Domination problems with no conflicts (Q1752590) (← links)
- The quadratic shortest path problem: complexity, approximability, and solution methods (Q1754341) (← links)
- Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times (Q1761212) (← links)
- Efficient solutions for the far from most string problem (Q1761847) (← links)
- Data-independent neighborhood functions and strict local optima (Q1763477) (← links)
- Optimal covering designs: complexity results and new bounds (Q1765237) (← links)
- On the differential approximation of MIN SET COVER (Q1770405) (← links)
- Learning local transductions is hard (Q1770836) (← links)
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- The complexity of base station positioning in cellular networks (Q1775056) (← links)
- Designing optimally multiplexed SNP genotyping assays (Q1775775) (← links)
- The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← links)
- Packing triangles in bounded degree graphs. (Q1853132) (← links)
- On the Hamming distance of constraint satisfaction problems. (Q1853512) (← links)
- The inapproximability of non-NP-hard optimization problems. (Q1853546) (← links)
- Logical analysis of data with decomposable structures. (Q1853578) (← links)
- Differential approximation for optimal satisfiability and related problems (Q1869721) (← links)
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times (Q1884949) (← links)
- On inverse traveling salesman problems (Q1936660) (← links)
- Hardness of approximation for crossing number (Q1943651) (← links)
- Dynamic data resolution to improve the tractability of UMTS network planning (Q1945081) (← links)
- Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
- Hardness results and approximation algorithm for total liar's domination in graphs (Q2015803) (← links)
- Solution methods for the vertex variant of the network system vulnerability analysis problem (Q2017536) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs (Q2025442) (← links)
