Pages that link to "Item:Q1213733"
From MaRDI portal
The following pages link to Approximation algorithms for combinatorial problems (Q1213733):
Displaying 50 items.
- On the distribution of the domination number for random class cover catch digraphs (Q158221) (← links)
- Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
- A-priori upper bounds for the set covering problem (Q271942) (← links)
- It is hard to know when greedy is good for finding independent sets (Q286978) (← links)
- Improved performance of the greedy algorithm for partial cover (Q293139) (← links)
- Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} (Q293272) (← links)
- Feedback vertex set in hypercubes (Q294845) (← links)
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Towards the price of leasing online (Q346515) (← links)
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- Survivable network activation problems (Q386909) (← links)
- Identifying path covers in graphs (Q396675) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
- Computing optimal islands (Q433119) (← links)
- Approximating the traffic grooming problem in tree and star networks (Q436821) (← links)
- Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Circulant graphs and GCD and LCM of subsets (Q477605) (← links)
- On finding the longest antisymmetric path in directed acyclic graphs (Q477694) (← links)
- The computational complexity and approximability of a series of geometric covering problems (Q483201) (← links)
- Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- Learning discrete decomposable graphical models via constraint optimization (Q517387) (← links)
- On the relation between rough set reducts and typical testors (Q526674) (← links)
- Capacitated domination problem (Q534769) (← links)
- Approximating minimum-power degree and connectivity problems (Q547290) (← links)
- Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms (Q622140) (← links)
- Uniform unweighted set cover: the power of non-oblivious local search (Q631761) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- Computing functions with parallel queries to NP (Q673784) (← links)
- A parallel algorithm for the minimum weighted vertex cover problem (Q674187) (← links)
- Randomized approximation of bounded multicovering problems (Q679446) (← links)
- A note on the descriptive complexity of maximization problems (Q685495) (← links)
- A biased random-key genetic algorithm for the Steiner triple covering problem (Q691474) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Variable neighborhood search for the maximum clique (Q705505) (← links)
- Min-sum bin packing (Q721936) (← links)
- Covering compact metric spaces greedily (Q722361) (← links)
- The ordered covering problem (Q722532) (← links)
- Indirect unstructured hex-dominant mesh generation using tetrahedra recombination (Q722824) (← links)
- Partial covering arrays: algorithms and asymptotics (Q726106) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- Hitting sets online and unique-MAX coloring (Q741535) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- Teachability in computational learning (Q749233) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- On approximation problems related to the independent set and vertex cover problems (Q760210) (← links)
