Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in H-Free Graphs

doi 10.1137/1.9781611975994.139
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

Approximation Schemes via Width/Weight Trade-Offs on Minor-Free Graphs

2020English

Message Passing for Maximum Weight Independent Set

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2009English

Polynomial-Time Approximation Scheme for Minimum K-Cut in Planar and Minor-Free Graphs

2019English

Efficient Independent Set Approximation in Unit Disk Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Polynomial-Time Approximation Schemes for Scheduling Problems With Time Lags

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2009English

Baker Game and Polynomial-Time Approximation Schemes

2020English

Approximation Schemes for the Min-Max Starting Time Problem

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2004English

Robust Maximum Weighted Independent-Set Problems on Interval Graphs

SSRN Electronic Journal
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy