The following pages link to (Q4258216):
Displaying 50 items.
- Partition into cliques for cubic graphs: Planar case, complexity and approximation (Q947111) (← links)
- \(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems (Q951128) (← links)
- Large independent sets in general random intersection graphs (Q952443) (← links)
- The 0-1 inverse maximum stable set problem (Q955316) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
- On the approximability of the simplified partial digest problem (Q967421) (← links)
- Minimum dominating set of queens: a trivial programming exercise? (Q968146) (← links)
- Mathematical models for optimal usage of tributary cards in wavelength assignment for DWDM ring networks (Q969908) (← links)
- Approximability of clausal constraints (Q970111) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- Playing monotone games to understand learning behaviors (Q974103) (← links)
- Mean analysis of an online algorithm for the vertex cover problem (Q987781) (← links)
- Precoloring extension of co-Meyniel graphs (Q995757) (← links)
- Routing to reduce the cost of wavelength conversion (Q1005233) (← links)
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem (Q1006053) (← links)
- Fast payment schemes for truthful mechanisms with verification (Q1006066) (← links)
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
- Computing small partial coverings (Q1007552) (← links)
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (Q1009187) (← links)
- Approximation algorithms for multi-criteria traveling salesman problems (Q1017906) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- Algorithms for compact letter displays: comparison and evaluation (Q1020871) (← links)
- The transportation problem with exclusionary side constraints (Q1022437) (← links)
- Approximability of minimum AND-circuits (Q1024782) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← links)
- Minimum-weight cycle covers and their approximability (Q1028118) (← links)
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs (Q1029052) (← links)
- The minimum likely column cover problem (Q1029075) (← links)
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626) (← links)
- \((r,p)\)-centroid problems on paths and trees (Q1034634) (← links)
- Improved parameterized set splitting algorithms: A Probabilistic approach (Q1040647) (← links)
- Non-approximability of weighted multiple sequence alignment for arbitrary metrics (Q1041795) (← links)
- A note on submodular set cover on matroids (Q1045066) (← links)
- Computational complexity in additive hedonic games (Q1046065) (← links)
- Non-approximability of weighted multiple sequence alignment. (Q1401267) (← links)
- Domination analysis of combinatorial optimization problems. (Q1406045) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- Channel assignment on graphs of bounded treewidth (Q1417576) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- Hardness of approximation for non-overlapping local alignments. (Q1427808) (← links)
- Inapproximability and a polynomially solvable special case of a network improvement problem. (Q1428068) (← links)
- Some APX-completeness results for cubic graphs (Q1566710) (← links)
- On bounded occurrence constraint satisfaction (Q1607037) (← links)
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333) (← links)
- The hardness of placing street names in a Manhattan type map (Q1608339) (← links)
- Theoretical complexity of grid cover problems used in radar applications (Q1626552) (← links)
