Pages that link to "Item:Q1196452"
From MaRDI portal
The following pages link to Approximating maximum independent sets by excluding subgraphs (Q1196452):
Displayed 48 items.
- Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Cutting planes cannot approximate some integer programs (Q453048) (← links)
- Topological graph persistence (Q827588) (← links)
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- Approximating the maximum vertex/edge weighted clique using local search (Q1009183) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- Approximating maximum independent sets by excluding subgraphs (Q1196452) (← links)
- A still better performance guarantee for approximate graph coloring (Q1209311) (← links)
- On a scheduling problem of time deteriorating jobs (Q1271170) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- The maximum clique problem (Q1318271) (← links)
- Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) (← links)
- MNP: A class of NP optimization problems (Q1368182) (← links)
- Approximating the independence number via the \(\vartheta\)-function (Q1380939) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- Clique is hard to approximate within \(n^{1-\epsilon}\) (Q1588908) (← links)
- Heuristics for semirandom graph problems (Q1604213) (← links)
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
- The inapproximability of non-NP-hard optimization problems. (Q1853546) (← links)
- On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
- Towards optimal lower bounds for clique and chromatic number. (Q1874411) (← links)
- On the approximability of clique and related maximization problems (Q1877696) (← links)
- Independent sets with domination constraints (Q1962033) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- On the induced matching problem in Hamiltonian bipartite graphs (Q2059914) (← links)
- Detecting a botnet in a network (Q2078962) (← links)
- The variational quantum eigensolver: a review of methods and best practices (Q2092477) (← links)
- Phased local search for the maximum clique problem (Q2369988) (← links)
- The complexity of detecting fixed-density clusters (Q2499577) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- On the independent set problem in random graphs (Q2804023) (← links)
- Maximum Weighted Independent Sets with a Budget (Q2971655) (← links)
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
- Reoptimization of Weighted Graph and Covering Problems (Q3602840) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- On-line resource management with applications to routing and scheduling (Q4645187) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
- Improved approximations of independent sets in bounded-degree graphs (Q5054761) (← links)
- Hard graphs for randomized subgraph exclusion algorithms (Q5054768) (← links)
- On the approximability of the maximum common subgraph problem (Q5096796) (← links)
- Multitasking Capacity: Hardness Results and Improved Constructions (Q5220467) (← links)
- Mining relevant information on the Web: a clique-based approach (Q5444416) (← links)
- Improved lower bounds for the randomized Boppana-Halldórsson algorithm for MAXCLIQUE (Q6085752) (← links)
- The power of amortized recourse for online graph problems (Q6176555) (← links)