Parallel approximation schemes for problems on planar graphs

This paper describes a technique to obtain NC approximation schemes for the Maximum Independent Set in planar graphs and related optimization problems.

Bibliographic Details
Authors: Díaz Cort, Josep|||0000-0003-4422-0067, Serna Iglesias, María José|||0000-0001-9729-8648, Torán Romero, Jacobo
Format: report
Publication Date:1993
Country:España
Institution:Universitat Politècnica de Catalunya (UPC)
Repository:UPCommons. Portal del coneixement obert de la UPC
Language:English
OAI Identifier:oai:upcommons.upc.edu:2117/97222
Online Access:https://hdl.handle.net/2117/97222
Access Level:Open access
Keyword:Planar graphs
NC
Approximation schemes Maximum independent set
Optimization
Description
Summary:This paper describes a technique to obtain NC approximation schemes for the Maximum Independent Set in planar graphs and related optimization problems.

Similar Items