Pages that link to "Item:Q1186548"
From MaRDI portal
The following pages link to Optimization, approximation, and complexity classes (Q1186548):
Displaying 50 items.
- Approximability of scheduling problems with resource consuming jobs (Q256641) (← links)
- Combinatorial PCPs with short proofs (Q260390) (← links)
- On the ordered list subgraph embedding problems (Q270006) (← links)
- Orienting graphs to optimize reachability (Q290248) (← links)
- The NPO-completeness of the longest Hamiltonian cycle problem (Q293205) (← links)
- Approximate Max \(k\)-Cut with subgraph guarantee (Q293220) (← links)
- Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} (Q293272) (← links)
- A natural family of optimization problems with arbitrarily small approximation thresholds (Q293457) (← links)
- Tractability-preserving transformations of global cost functions (Q309935) (← links)
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Graph editing to a fixed target (Q344855) (← links)
- The maximum flow problem with disjunctive constraints (Q358660) (← links)
- Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
- A note on anti-coordination and social interactions (Q386417) (← links)
- Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
- Revisiting the minimum breakpoint linearization problem (Q391095) (← links)
- Complexity of majority monopoly and signed domination problems (Q414422) (← links)
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- A randomized PTAS for the minimum consensus clustering with a fixed number of clusters (Q418755) (← links)
- On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) (← links)
- The locomotive fleet fueling problem (Q433838) (← links)
- NP-completeness and APX-completeness of restrained domination in graphs (Q442103) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- The traveling salesman problem with flexible coloring (Q444446) (← links)
- Online maximum directed cut (Q454250) (← links)
- On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules (Q456005) (← links)
- Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
- On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Reoptimization of max \(k\)-cover: approximation ratio threshold (Q466363) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Independent dominating set problem revisited (Q476836) (← links)
- The computational complexity and approximability of a series of geometric covering problems (Q483201) (← links)
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619) (← links)
- A note on the clustered set covering problem (Q496643) (← links)
- The interval constrained 3-coloring problem (Q500992) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
- On robust clusters of minimum cardinality in networks (Q513606) (← links)
- Optimization problems in multiple subtree graphs (Q531599) (← links)
- Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
- Approximation algorithms for grooming in optical network design (Q551206) (← links)
- Inapproximability of maximal strip recovery (Q551208) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903) (← links)
