FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/b104325zbMath1117.68549OpenAlexW2950473912MaRDI QIDQ5465866

Gerold Jäger, Anand Srivastav

Publication date: 12 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b104325

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)

Related Items (1)

Approximation algorithms for the bi-criteria weighted MAX-CUT problem

Uses Software

• CPLEX

This page was built for publication: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science