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

Garg, Naveen; Vazirani, Vijay V.

doi:10.1007/BF01585926

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

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
(出版社版)

Fulltext (restricted access)

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

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

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.

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

要旨

要旨はありません