scientific article; zbMATH DE number 1833408
From MaRDI portal
Publication:4780789
zbMath1010.90065MaRDI QIDQ4780789
Publication date: 21 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2129/21290138
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (7)
Fast Distributed Approximation for Max-Cut ⋮ On the approximability of digraph ordering ⋮ Unnamed Item ⋮ Simple approximation algorithms for balanced MAX~2SAT ⋮ Unnamed Item ⋮ Online Submodular Maximization with Preemption ⋮ Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
This page was built for publication:
