A Polyhedron with all s-t Cuts as Vertices, and Adjacency of Cuts

Garg, Naveen; Vazirani, Vijay V.

doi:10.1007/BF01585926

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

A Polyhedron with all s-t Cuts as Vertices, and Adjacency of Cuts

MPS-Authors

/persons/resource/persons44477

Garg, Naveen
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dtBdN
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Garg, N., & Vazirani, V. V. (1995). A Polyhedron with all s-t Cuts as Vertices, and Adjacency of Cuts. Mathematical Programming / A, 70(1), 17-25. doi:10.1007/BF01585926.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AC61-7

Abstract

There is no abstract available