Fault tolerant max-cut
From MaRDI portal
Cites work
- A constant factor approximation algorithm for the fault-tolerant facility location problem
- A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners
- An approximation algorithm for the fault tolerant metric facility location problem
- An integer programming approach for fault-tolerant connected dominating sets
- Approximating CSPs with global cardinality constraints using SDP hierarchies
- Approximating the Cut-Norm via Grothendieck's Inequality
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- Approximation and Online Algorithms
- Better balance by being biased: a 0.8776-approximation for {\textsc{Max Bisection}}
- Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
- Clustering with qualitative information
- Correlation clustering, maximizing agreements via semidefinite programming
- Derandomizing Approximation Algorithms Based on Semidefinite Programming
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles
- Directed spanners via flow-based linear programs
- Distributed constructions of dual-failure fault-tolerant distance preservers
- Dual failure resilient BFS structure
- Fault Tolerant Approximate BFS Structures
- Fault tolerant reachability for directed graphs
- Fault tolerant subgraph for single source reachability: generic and optimal
- Fault-tolerant approximate shortest-path trees
- Fault-tolerant facility location
- Fault-tolerant spanners
- From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics
- Gadgets, Approximation, and Linear Programming
- scientific article; zbMATH DE number 2079349 (Why is no real title available?)
- scientific article; zbMATH DE number 6850433 (Why is no real title available?)
- scientific article; zbMATH DE number 2086914 (Why is no real title available?)
- scientific article; zbMATH DE number 1833408 (Why is no real title available?)
- Improved algorithms for constructing fault-tolerant spanners
- Improved approximation algorithms for MAX SAT
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Improved distance sensitivity oracles via fast single-source replacement paths
- Multiple source dual fault tolerant BFS trees
- Near optimal algorithm for the directed single source replacement paths problem
- Near optimal algorithms for the single source replacement paths problem
- Near-optimal approximation algorithm for simultaneous Max-Cut
- On the power of unique 2-prover 1-round games
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
- Preserving distances in very faulty graphs
- Reducibility among combinatorial problems
- Replacement paths and k simple shortest paths in unweighted directed graphs
- Robust fault tolerant uncapacitated facility location
- Robust monotone submodular function maximization
- Simultaneous approximation of constraint satisfaction problems
- Simultaneous max-cut is harder to approximate than max-cut
- Some optimal inapproximability results
- Some simplified NP-complete graph problems
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Vertex fault tolerant additive spanners
This page was built for publication: Fault tolerant max-cut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241144)
