Giorgio Ausiello Géraud Sénizergues Zero-weight cycle problem Mixed criticality Symposium on Experimental Algorithms Edge dominating set L-reduction 3-dimensional matching MAX-3SAT Karelsulcia muelleri Maximum cut Matching (graph theory) Approximation algorithm Shortest path problem Fully polynomial-time approximation scheme Barna Saha
Giorgio Ausiello
Géraud Sénizergues
Zero-weight cycle problem
Mixed criticality
Symposium on Experimental Algorithms
Edge dominating set
L-reduction
3-dimensional matching
MAX-3SAT
Karelsulcia muelleri
Maximum cut
Matching (graph theory)
Approximation algorithm
Shortest path problem
Fully polynomial-time approximation scheme
Barna Saha
Géraud Sénizergues
Zero-weight cycle problem
Mixed criticality
Symposium on Experimental Algorithms
Edge dominating set
L-reduction
3-dimensional matching
MAX-3SAT
Karelsulcia muelleri
Maximum cut
Matching (graph theory)
Approximation algorithm
Shortest path problem
Fully polynomial-time approximation scheme
Barna Saha