A better approximation algorithm for finding planar subgraphs

Gruia Călinescu, C. G. F., Finkler, U., & Karloff, H. (1997). A better approximation algorithm for finding planar subgraphs.

Type

Unclassified

Intellectual base

Unclassified

Year

1997

DOI

10.1006/jagm.1997.0920

Link

https://doi.org/10.1006/jagm.1997.0920

Cited by

1 citation across 1 artifact.

Domain-specific

• Matroid parity problem
  • Matroid parity asks for a maximum-size set of pairs such that taking both elements from every chosen pair yields an independent matroid set.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:ebc32e9ef7a2 · see in the full table