Pages that link to "Item:Q5248497"
From MaRDI portal
The following pages link to On the hardness of approximating minimization problems (Q5248497):
Displayed 50 items.
- An approximation algorithm for clustering graphs with dominating diametral path (Q290198) (← links)
- Lower and upper bounds for long induced paths in 3-connected planar graphs (Q290522) (← links)
- Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- Approximate association via dissociation (Q505447) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- Average case analysis of greedy algorithms for optimisation problems on set systems (Q672472) (← links)
- Approximation algorithms for time constrained scheduling (Q676776) (← links)
- On approximating the longest path in a graph (Q679451) (← links)
- A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453) (← links)
- A well-characterized approximation problem (Q688442) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Selection of relevant features and examples in machine learning (Q1127357) (← links)
- An adaptive, multiple restarts neural network algorithm for graph coloring (Q1268156) (← links)
- Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
- Approximations for subset interconnection designs (Q1274995) (← links)
- Reconstructing a history of recombinations from a set of sequences (Q1281773) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- On the complexity of diagram testing (Q1319079) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- Approximation results for the minimum graph coloring problem (Q1321829) (← links)
- The hardness of approximation: Gap location (Q1332662) (← links)
- Maximizing the number of unused colors in the vertex coloring problem (Q1336741) (← links)
- Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) (← links)
- Mutual exclusion scheduling (Q1365931) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- Approximation algorithms for general parallel task scheduling (Q1603514) (← links)
- Local majorities, coalitions and monopolies in graphs: A review (Q1603713) (← links)
- The complexity of theory revision (Q1606294) (← links)
- Some new results in the complexity of allocation and binding in data path synthesis (Q1608404) (← links)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- Three-quarter approximation for the number of unused colors in graph coloring (Q1818979) (← links)
- Scheduling of conditional executed jobs on unrelated processors (Q1897352) (← links)
- A robust model for finding optimal evolutionary tree (Q1902471) (← links)
- On the longest circuit in an alterable digraph (Q1904653) (← links)
- Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
- The complexity of approximating a nonlinear program (Q1906280) (← links)
- The complexity of cover graph recognition for some varieties of finite lattices (Q1908932) (← links)
- A computationally intractable problem on simplicial complexes (Q1917045) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- The minimum-entropy set cover problem (Q2581268) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs (Q4210164) (← links)
- Bicriteria Network Design Problems (Q4216149) (← links)
- Worst-case performance of approximation algorithms for tool management problems (Q4266753) (← links)
- The approximation of maximum subgraph problems (Q4630247) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249) (← links)
- On the approximation of shortest common supersequences and longest common subsequences (Q4632426) (← links)