Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing- United States

doi 10.1137/s0097539702402676

Full Text

Abstract

Available in

Categories

Computer Science

Date

January 1, 2005

Authors

Thomas Erlebach

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Polynomial-Time Approximation Schemes for Scheduling Problems With Time Lags

Journal of Scheduling

Management Science

Operations Research

Artificial Intelligence

English

Baker Game and Polynomial-Time Approximation Schemes

English

Approximation Algorithms for Intersection Graphs

Lecture Notes in Computer Science

Computer Science

Theoretical Computer Science

English

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

English

Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems

Journal of Computer and System Sciences

Computer Networks

Applied Mathematics

Computational Theory

Theoretical Computer Science

English

A Polynomial Bound for Untangling Geometric Planar Graphs

Discrete and Computational Geometry

Discrete Mathematics

Computational Theory

Theoretical Computer Science

English

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

English

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

English

Approximation Schemes for Preemptive Weighted Flow Time

English