The following pages link to (Q4886045):
Displaying 50 items.
- Traveling salesman problems in temporal graphs (Q284573) (← links)
- Tractability and approximability of maximal strip recovery (Q441877) (← links)
- On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903) (← links)
- Uniform unweighted set cover: the power of non-oblivious local search (Q631761) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs (Q839632) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations (Q897944) (← links)
- A better differential approximation ratio for symmetric TSP (Q924134) (← links)
- On finding augmenting graphs (Q955317) (← links)
- New differential approximation algorithm for \(k\)-customer vehicle routing problem (Q976133) (← links)
- Hierarchically specified unit disk graphs (Q1269904) (← links)
- Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
- Hardness of approximation for non-overlapping local alignments. (Q1427808) (← links)
- Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks (Q1662465) (← links)
- Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- Competitive algorithms for multistage online scheduling (Q1753459) (← links)
- A local search algorithm for binary maximum 2-path partitioning (Q1799391) (← links)
- Approximation algorithms for NMR spectral peak assignment. (Q1874392) (← links)
- Flexible coloring (Q1944945) (← links)
- A 6/5-approximation algorithm for the maximum 3-cover problem (Q1945696) (← links)
- On the solution bound of two-sided scaffold filling (Q2034400) (← links)
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- The limits of local search for weighted \(k\)-set packing (Q2164726) (← links)
- On spectrum sharing games (Q2377140) (← links)
- On sorting unsigned permutations by double-cut-and-joins (Q2377380) (← links)
- An approximation algorithm for maximum triangle packing (Q2492197) (← links)
- A modified greedy algorithm for dispersively weighted 3-set cover (Q2492216) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Improved Algorithm for Maximum Independent Set on Unit Disk Graph (Q2795948) (← links)
- Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488) (← links)
- Tractability and Approximability of Maximal Strip Recovery (Q3011866) (← links)
- An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915) (← links)
- Improved Approximation Algorithms for Weighted 2-Path Partitions (Q3452854) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective (Q3464477) (← links)
- Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs (Q3467876) (← links)
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem (Q3599128) (← links)
- A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling (Q4632215) (← links)
- Approximating k-set cover and complementary graph coloring (Q4645918) (← links)
- Dual parameterization of Weighted Coloring (Q5009474) (← links)
- Approximation of Constraint Satisfaction via local search (Q5057457) (← links)
- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) (Q5057461) (← links)
- Approximation algorithms for a genetic diagnostics problem (Q5096927) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup> (Q5856438) (← links)
- (Q5874491) (← links)
- A randomized approximation algorithm for metric triangle packing (Q5918266) (← links)
