<we><edit> <!-- questions and answers -->
convex-optimization
graph-colouring
gr.group-theory
type-theory
co.combinatorics
approximation-hardness
spectral-graph-theory
soft-question
physics
fl.formal-languages
open-problem
nondeterminism
functional-programming
coding-theory
randomized-algorithms
matrices
integer-programming
shortest-path
cr.crypto-security
dc.parallel-comp
research-practice
reference-request
boolean-functions
np-complete
space-bounded
approximation-algorithms
Is there any better than (2/k)-approximation algorithm for Independent Set in Coloring graph?
graph-theory
approximation-algorithms
approximation-hardness
Minimizing SubModular Function: Cardinality
ds.algorithms
approximation-algorithms
submodularity
More efficient max-flow algorithms
graph-algorithms
approximation-algorithms
spectral-graph-theory
na.numerical-analysis
max-flow-min-cut
About using smoothness of the Hessian for getting to approximate criticality of a non-convex objective
np-hardness
approximation-algorithms
optimization
machine-learning
What is the fastest gradient based algorithm to get to criticality of a "nice" non-convex function?
ds.algorithms
reference-request
approximation-algorithms
Hardness of Approximation for minimum path cover in an undirected graph?
cc.complexity-theory
graph-theory
approximation-algorithms
approximation-hardness
Getting to local/global minima with (stochastic) gradient descent on non-convex objectives
reference-request
approximation-algorithms
optimization
stochastic-process
Approximating a monotone submodular function using a concrete coverage function
approximation-algorithms
approximation-hardness
submodularity
Monotone supermodular function minimization under partition matroid constraints
approximation-algorithms
optimization
submodularity
Learning hidden variable distribution
approximation-algorithms
machine-learning
randomized-algorithms
APX-Hard vs NP-Hard
approximation-algorithms
approximation-hardness
apx
Stacks serving interval storage requests
approximation-algorithms
optimization
scheduling
interval-graphs
Unbalanced connected partition
graph-theory
graph-algorithms
approximation-algorithms
partition-problem
Proof assistant usage in complexity theory research?
cc.complexity-theory
approximation-algorithms
soft-question
proof-assistants
Geometric max cover
np-hardness
approximation-algorithms
covering-problems
Does the following problem have a classical name (e.g. max flow, stable matching, etc) and if so is there an efficient solution?
ds.algorithms
reference-request
approximation-algorithms
Common terminology used for lower/upper bounds
graph-theory
approximation-algorithms
optimization
lower-bounds
upper-bounds
On approximating problems in $\#P$
cc.complexity-theory
approximation-algorithms
counting-complexity
derandomization
polynomial-hierarchy
An optimal subspace projection problem
np-hardness
approximation-algorithms
linear-algebra
approximation-hardness
high-dimensional-geometry
Find an approximate argmax using only approximate max queries
approximation-algorithms
randomized-algorithms
search-problem
random-walks
binary-trees
\alpha-path on Euclidean graphs
ds.algorithms
graph-algorithms
approximation-algorithms
ds.data-structures
lower-bounds
Lower bound for Yao's algorithm on general addition chains?
approximation-algorithms
lower-bounds
approximation
Hausdorff Distance and Convex Hull
approximation-algorithms
computational-geometry
convex-geometry
On the impossibility of representing/approximating subadditive function using additive functions
approximation-algorithms
approximation-hardness
submodularity
Practical/heuristic algorithm for multi set-cover
ds.algorithms
reference-request
approximation-algorithms
heuristics
Is it possible to approximate Maximum Independent Set in $O(2^k\text{poly}(n))$ time?
ds.algorithms
approximation-algorithms
fixed-parameter-tractable
exp-time-algorithms
Stochastic dynamic programming problem that is Approximation-hard
cc.complexity-theory
co.combinatorics
approximation-algorithms
approximation-hardness
Clique cover problem
graph-theory
graph-algorithms
np-hardness
approximation-algorithms
Approximating max degree $3$ perfect matching count?
approximation-algorithms
permanent
Rules of thumb for universal approximation
approximation-algorithms
ne.neural-evol
norms
Why is HyperLogLog (near-)optimal?
ds.algorithms
approximation-algorithms
data-streams
probabilistic-computation
hardness of constant approximation of largest matching set
cc.complexity-theory
approximation-algorithms
reductions
approximation-hardness
Approximating the Radius of a (Dense) Graph
graph-algorithms
approximation-algorithms
approximation-hardness
approximation
fine-grained
How to partition a graph while minimizing the count of intra-edges?
graph-theory
graph-algorithms
approximation-algorithms
graph-colouring
partition-problem
Sparse-cut approximation for well connected graphs
approximation-algorithms
spectral-graph-theory
max-flow-min-cut
unique-games-conjecture
promise-problems
Studying the hardness of polynomial-time approximability using the concept of stability of approximation
approximation-algorithms
optimization
approximation-hardness
Deterministic approximation algorithms for treewidth
reference-request
approximation-algorithms
derandomization
treewidth
Alternative Set Cover Algorithm With Doubling
approximation-algorithms
set-cover
Coreset and VC dimension
approximation-algorithms
computational-geometry
sample-complexity
Looking for approximation class between NPO and Exp-APX
complexity-classes
approximation-algorithms
approximation-hardness
approximation
Sparse coding and matching pursuit algorithms
cc.complexity-theory
ds.algorithms
np-hardness
approximation-algorithms
sparse-matrix
Is it sufficient to only check on the vertices? Greedy algorithm
approximation-algorithms
optimization
greedy-algorithms
What is known about data structures for encoding a set while considering approximate Rank queries?
ds.algorithms
approximation-algorithms
ds.data-structures
encoding
Is the current best approximation ratio for Vertex Cover problem also a lower bound?
approximation-algorithms
approximation-hardness
Any fast algorithm for minimum cost feedback arc set problem?
ds.data-structures
graph-theory
np-hardness
approximation-algorithms
Trying to understand a paper on ksvd algorithm (dictionary learning) by Elad, et al
approximation-algorithms
machine-learning
paper-review
On permanent of $\{\pm1,0\}$ matrices
cc.complexity-theory
ds.algorithms
approximation-algorithms
matrices
permanent
Finding minimum weight $k$ cliques in a complete graph
graph-algorithms
approximation-algorithms
clique
Compression algorithms for low-complexity strings?
approximation-algorithms
context-free
kolmogorov-complexity
Approaches for Theoretical Analysis of Estimates of Probability Distributions
reference-request
graph-algorithms
approximation-algorithms
pr.probability
Difference between Multiple Knapsack problem and Multidimensional Knapsack Problem
approximation-algorithms
linear-programming
integer-programming
integrality-gap
What does "no integrality gap" imply?
cc.complexity-theory
approximation-algorithms
optimization
linear-programming
integrality-gap
The importance of Integrality Gap
cc.complexity-theory
ds.algorithms
approximation-algorithms
linear-programming
integrality-gap
Is there an approximation algorithm for MAX k DOUBLE SET COVER?
reference-request
approximation-algorithms
set-cover
hypergraphs
covering-problems
Maximize the weight of MST + sum of vertex weights
ds.algorithms
graph-theory
approximation-algorithms
tree
submodularity
Given a matrix $A$ maximize the number of positive elements in $Ax$ under specific constraints for $x$
np-hardness
approximation-algorithms
linear-algebra
Positive cut algorithm on bipartite graphs with negative weights
ds.algorithms
graph-theory
approximation-algorithms
max-cut
Max-cut with negative weight edges
ds.algorithms
graph-theory
approximation-algorithms
max-cut
Truthful posted-price mechanism with optimal efficiency (social welfare)
approximation-algorithms
approximation
mechanism-design
Brute force search algorithm for semidefinite programming (representation of spectrahedron)
approximation-algorithms
linear-programming
convex-optimization
integer-programming
semidefinite-programming
Set cover problem with the same amount of sets and elements
ds.algorithms
np-hardness
approximation-algorithms
approximation-hardness
np-complete
Maximize number of edges covered by an independent set of vertices
reference-request
graph-theory
approximation-algorithms
approximation-hardness
terminology
Algorithms to approximate a Riemann integrable function by a piecewise constant function
approximation-algorithms
Finding smallest context free grammar that generates a set of sets
cc.complexity-theory
approximation-algorithms
grammars
context-free
heuristics
Approximating the VM packing problem
ds.algorithms
reference-request
approximation-algorithms
Quantum complexity of maximum inner product search
approximation-algorithms
quantum-computing
linear-algebra
Density of multiples
ds.algorithms
reference-request
approximation-algorithms
na.numerical-analysis
promise-problems
Online/approximate weighted and capacitated bipartite matching
graph-theory
approximation-algorithms
matching
online-algorithms
bipartite-graphs
Ordering of a DAG minimizing some definition of cost
graph-theory
approximation-algorithms
directed-acyclic-graph
Given oracle for Max-3SAT compute clauses that cannot be satisfied
np-hardness
approximation-algorithms
sat
approximation-hardness
oracles
Solution/Hardness of the following (integer) budgeted problem?
ds.algorithms
np-hardness
approximation-algorithms
optimization
algorithms for a large submatrix / general factor / quasi-biclique problem?
graph-algorithms
approximation-algorithms
clustering
boolean-matrix
bipartite-graphs
Efficient algorithms for counting $k$-clique subgraphs
ds.algorithms
graph-algorithms
approximation-algorithms
counting-complexity
Partial cover approximation
approximation-algorithms
set-cover
How can we bound the optimal solution of the dual bin packing when we solve the knapsack problem for each bin?
approximation-algorithms
lower-bounds
Weighted $l_1$ distance
approximation-algorithms
computational-geometry
Percolation probabilities
graph-theory
approximation-algorithms
pr.probability
statistical-physics
Max-sum graph-partition for maximizing intra-edge weights?
graph-theory
graph-algorithms
approximation-algorithms
clustering
partition-problem
Fast Approximation Algorithms for Covering Design
reference-request
co.combinatorics
approximation-algorithms
covering-problems
About representability of optimization versions of NP-complete questions as polynomial optimization over the hypercube
np-hardness
approximation-algorithms
approximation-hardness
np
np-complete
Quantum approximation algorithms
quantum-computing
approximation-algorithms
Does k-PATH admit a constant approximation?
cc.complexity-theory
ds.algorithms
approximation-algorithms
Maximizing a monotone supermodular function s.t. cardinality
ds.algorithms
approximation-algorithms
optimization
approximation-hardness
submodularity
Stochastic optimization with erroneous oracles
reference-request
approximation-algorithms
optimization
stochastic-process
Maximizing the number of selected edges with opposing requirements
cc.complexity-theory
ds.algorithms
graph-theory
approximation-algorithms
approximation-hardness
L-reduction From Matrix-Tiling To Minimal Dominating Set in Unit Disk Graph
approximation-algorithms
reductions
Complexity of minimizing monotone arithmetical formulas
cc.complexity-theory
np-hardness
approximation-algorithms
heuristics
Complexity of approximating the range of a matrix
cc.complexity-theory
approximation-algorithms
linear-algebra
What is the reverse of greedy algorithm for setcover?
approximation-algorithms
set-cover
greedy-algorithms
Set Cover variant- improvement over log(n) approximation?
approximation-algorithms
Which is the approximation class of Minimum 0-1 integer programming if only non-negative integers are allowed?
complexity-classes
approximation-algorithms
integer-programming
Approximation algorithms for the maximum $2$-independence set problem
graph-theory
approximation-algorithms
approximation-hardness
maximize MST(G[S]) over all induced subgraphs G[S] in a metric graph
ds.algorithms
graph-algorithms
np-hardness
approximation-algorithms
Optimal greedy algorithms for NP-hard problems
cc.complexity-theory
lower-bounds
approximation-algorithms
greedy-algorithms
approximation-hardness
Approximating the clique size of the graph
graph-theory
graph-algorithms
approximation-algorithms
Distributing bags of apples equally
approximation-algorithms
np-complete
partition-problem
Linear Programing with Rounding for the Fire Station Problem
cc.complexity-theory
approximation-algorithms
linear-programming
The complexity of decomposing a bi-stochastic matrix
ds.algorithms
co.combinatorics
approximation-algorithms
permutations
permanent
On approx-preserving P- and A-reducibilities
ds.algorithms
np-hardness
approximation-algorithms
approximation-hardness
Maximize number of bins and minimize cost of elements chosen from a set
ds.algorithms
co.combinatorics
approximation-algorithms
packing
submodularity