A survey on approximation in parameterized complexity: Hardness and algorithms
Parameterization and approximation are two popular ways of coping with NP-hard
problems. More recently, the two have also been combined to derive many interesting …
problems. More recently, the two have also been combined to derive many interesting …
Fitting metrics and ultrametrics with minimum disagreements
V Cohen-Addad, C Fan, E Lee… - 2022 IEEE 63rd Annual …, 2022 - ieeexplore.ieee.org
Given x∈(R_\geqslant0)(_2^n) recording pairwise distances, the Metric Violation Distance
problem asks to compute the 0 distance between x and the metric cone; ie, modify the …
problem asks to compute the 0 distance between x and the metric cone; ie, modify the …
On lifting integrality gaps to SSEH hardness for globally constrained csps
A μ-constrained Boolean MAX-CSP (ψ) instance is a Boolean Max-CSP instance on
predicate ψ:{0,1\}^r→{0,1\} where the objective is to find a labeling of relative weight exactly …
predicate ψ:{0,1\}^r→{0,1\} where the objective is to find a labeling of relative weight exactly …
Approximating multicut and the demand graph
C Chekuri, V Madan - Proceedings of the Twenty-Eighth Annual ACM-SIAM …, 2017 - SIAM
In the minimum Multicut problem, the input is an edge-weighted supply graph G=(V, E) and a
demand graph H=(V, F). Either G and H are directed (Dir-MülC) or both are undirected …
demand graph H=(V, F). Either G and H are directed (Dir-MülC) or both are undirected …
Generalized metric repair on graphs
Many modern data analysis algorithms either assume or are considerably more efficient if
the distances between the data points satisfy a metric. These algorithms include metric …
the distances between the data points satisfy a metric. These algorithms include metric …
[PDF][PDF] The quest for strong inapproximability results with perfect completeness
J Brakensiek, V Guruswami - Approximation, Randomization, and …, 2017 - drops.dagstuhl.de
Abstract The Unique Games Conjecture (UGC) has pinned down the approximability of all
constraint satisfaction problems (CSPs), showing that a natural semidefinite programming …
constraint satisfaction problems (CSPs), showing that a natural semidefinite programming …
The quest for strong inapproximability results with perfect completeness
J Brakensiek, V Guruswami - ACM Transactions on Algorithms (TALG), 2021 - dl.acm.org
The Unique Games Conjecture has pinned down the approximability of all constraint
satisfaction problems (CSPs), showing that a natural semidefinite programming relaxation …
satisfaction problems (CSPs), showing that a natural semidefinite programming relaxation …
A new survey on the firefighter problem
C Wagner - 2021 - dspace.library.uvic.ca
Firefighter is a discrete-time dynamic process that models the spread of a virus or rumour
through a network. The name “Firefighter” arises from the initial analogy being the spread of …
through a network. The name “Firefighter” arises from the initial analogy being the spread of …
Improved algorithms for mst and metric-tsp interdiction
A Linhares, C Swamy - arXiv preprint arXiv:1706.00034, 2017 - arxiv.org
We consider the {\em MST-interdiction} problem: given a multigraph $ G=(V, E) $, edge
weights $\{w_e\geq 0\} _ {e\in E} $, interdiction costs $\{c_e\geq 0\} _ {e\in E} $, and an …
weights $\{w_e\geq 0\} _ {e\in E} $, interdiction costs $\{c_e\geq 0\} _ {e\in E} $, and an …
Network resilience assessment via QoS degradation metrics: an algorithmic approach
This paper focuses on network resilience to perturbation of edge weight. Other than
connectivity, many network applications nowadays rely upon some measure of network …
connectivity, many network applications nowadays rely upon some measure of network …