Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms

Sridhar Rajagopalan, V. V. V. (1999). Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms. ACM.

Type

Unclassified

Intellectual base

Unclassified

Year

1999

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Quasi-bipartite graph
  • Quasi-bipartite instances generalize bipartite terminal-side cases and admit stronger approximation algorithms than unrestricted Steiner tree, while edges among terminals remain allowed.

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:deaca78c55e3 · see in the full table