Pages that link to "Item:Q1213733"
From MaRDI portal
The following pages link to Approximation algorithms for combinatorial problems (Q1213733):
Displaying 50 items.
- Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
- On two restricted ancestors tree problems (Q765480) (← 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)
- A variable neighborhood search algorithm for the multimode set covering problem (Q887195) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← 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)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- Before and after vacuity (Q1028732) (← links)
- The greedy algorithm for domination in graphs of maximum degree 3 (Q1029047) (← links)
- On the hardness of approximating label-cover (Q1029090) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- Parameterized learnability of juntas (Q1034613) (← links)
- Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs (Q1041216) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis (Q1041744) (← links)
- Vertex covering by paths on trees with its applications in machine translation (Q1045903) (← links)
- Efficient bounds for the stable set, vertex cover and set packing problems (Q1056763) (← links)
