Tag: approximation-algorithms
Found 156 results for 'approximation-algorithms'.
1) cc.complexity-theory - NP-complete problems with optimal approximation in poly-time
2) ds.algorithms - Is there an online-algorithm to keep track of components in a changing undirected graph?
3) graph-theory - Variants of Densest Subgraph Problems
4) graph-theory - How bad can the greedy coloring (list color) for the c-chromatic number of graph be?
5) graph-theory - Approximation algorithms for the maximum $2$-independence set problem
6) complexity-classes - Looking for approximation class between NPO and Exp-APX
7) reference-request - Approximating Independent Dominating set on bipartite graphs
8) cc.complexity-theory - A variant of maximum matching: disjunctive constraints on the endpoints' degrees of edges in matching
9) graph-theory - finding maximum weight subgraph
10) cc.complexity-theory - Imperfect subgraph isomorphism
11) ds.algorithms - What is the fastest known algorithm for computing a 1.99-approximation of Vertex Cover?
12) reference-request - Covering by disjoint sets
13) ds.algorithms - Is DAG subset sum approximable?
14) ds.algorithms - Treewidth and Packing
15) cc.complexity-theory - Planted Clique in G(n,p), varying p
16) ds.algorithms - A simple approximation algorithm for the TSP
17) ds.algorithms - Partition a graph into two clusters
18) reference-request - Maximizing sum edge weights
19) cc.complexity-theory - Super-polynomial time approximation algorithms for optimization problems
20) cc.complexity-theory - Polynomial-time distinguishability threshold of planted clique
21) np-hardness - Two valued variant of subset sum problem
22) graph-theory - Is there any better than (2/k)-approximation algorithm for Independent Set in Coloring graph?
23) ds.algorithms - Approximation algorithms for Maximum Independent Set on special classes of graphs
24) approximation-algorithms - Is the current best approximation ratio for Vertex Cover problem also a lower bound?
25) ds.algorithms - Algorithms for Interval Coloring with Capacities and Demands
26) ds.algorithms - Max-cut with negative weight edges
27) cc.complexity-theory - Smoothed analysis of approximation algorithms
28) approximation-algorithms - Hardness of additive approximation to Graph Coloring problem.
29) ds.algorithms - Why differential approximation ratios are not well-studied comparing to standard ones despite of their claimed benefits?
30) ds.algorithms - Approximation Algorithms for MAXSAT
31) complexity-classes - Which is the approximation class of Minimum 0-1 integer programming if only non-negative integers are allowed?
32) reference-request - How can I find dependent rounding procedures with the desirable properties?
33) reference-request - Tight examples for approximating the feedback vertex set problem
34) cc.complexity-theory - Existence of $opt^c$-approximation of Dominating Set with $c < 1$?
35) ds.algorithms - Do there exist two equivalent objective functions one of which can be approximated but another one cannot?
36) reference-request - Is this greedy algorithm for vertex cover studied before?
37) graph-theory - State of the art approximation algorithm for $\text{MAXCUT}$ that does better than Goemans and Williamson
38) ds.algorithms - Maximizing a convex function with linear constraints
39) ds.algorithms - Maximizing a monotone supermodular function s.t. cardinality
40) graph-theory - Is the following graph optimization problem approximable within a constant factor?
41) cc.complexity-theory - Max cut problem between two connected subgraphs
42) cc.complexity-theory - Is Max-Cut APX-complete on triangle-free graphs?
43) ds.algorithms - A Multi-cut Problem
44) ds.algorithms - Integer Factoring via Lattice Reduction?
45) cc.complexity-theory - Count satisfying assignments of CNF formulas over all possible negation assignments
46) ds.algorithms - What's the approximation factor of this Max k-Cut approximation?
47) graph-algorithms - Approximate Maximum Weight Matching
48) ds.algorithms - Another variation of $k$-means problem in the plane
49) ds.algorithms - Approximate 1d TSP with linear comparisons?
50) ds.algorithms - Is there an online-algorithm to keep track of components in a changing undirected graph?