Pages that link to "Item:Q1213733"
From MaRDI portal
The following pages link to Approximation algorithms for combinatorial problems (Q1213733):
Displayed 50 items.
- On the distribution of the domination number for random class cover catch digraphs (Q158221) (← 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)
- Pseudo-Boolean optimization (Q697569) (← links)
- Variable neighborhood search for the maximum clique (Q705505) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← 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)
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319) (← links)
- Probabilistic behaviour of optimal bin-packing solutions (Q797494) (← links)
- The conjunctive complexity of quadratic Boolean functions (Q808253) (← links)
- Completeness in approximation classes (Q811119) (← links)
- Consistency-based search in feature selection (Q814528) (← links)
- Models of greedy algorithms for graph problems (Q834580) (← links)
- Simplified tight analysis of Johnson's algorithm (Q834942) (← links)
- Minimizing the stretch when scheduling flows of divisible requests (Q835622) (← links)
- Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs (Q839632) (← links)
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (Q844531) (← links)
- New primal-dual algorithms for Steiner tree problems (Q868154) (← links)
- Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks (Q876471) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
- Three optimizations for assume-guarantee reasoning with \(L^{*}\) (Q934701) (← links)
- Dominance guarantees for above-average solutions (Q937396) (← links)
- Rounding to an integral program (Q943791) (← links)
- Approximate clustering of incomplete fingerprints (Q954964) (← links)
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211) (← links)
- The minimum substring cover problem (Q958306) (← links)
- Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
- A \(\Theta (\log n)\)-approximation for the set cover problem with set ownership (Q976067) (← links)
- New lower bounds for bin packing problems with conflicts (Q976310) (← links)
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496) (← links)
- An efficient algorithm for minimum feedback vertex sets in rotator graphs (Q987789) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- An application of the greedy heuristic of set cover to traffic checks (Q1022400) (← links)
- Approximability of minimum AND-circuits (Q1024782) (← links)
- Connected domination of regular graphs (Q1025488) (← links)