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

doi 10.1137/1.9781611975482.65
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

A Fully Polynomial Time Approximation Scheme for Timing Driven Minimum Cost Buffer Insertion

2009English

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

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

2020English

Projective-Planar Graphs With No K 3, 4 -Minor. II

Journal of Graph Theory
GeometryTopology
2016English

A Fully Polynomial Time Approximation Scheme for Packing While Traveling

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

A Polynomial Time Approximation Scheme Fork-Consensus Clustering

2010English

Fast Minor Testing in Planar Graphs

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2011English

Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems.

2013English

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

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy