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

Garg, Naveen; Vazirani, Vijay V.

doi:10.1007/BF01585926

Local TagsRelease HistoryDetailsSummary

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

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AC61-7 Version Permalink: https://hdl.handle.net/21.11116/0000-000E-56ED-7

Genre: Journal Article

Files

show Files

Locators

show

hide

Locator:
https://rdcu.be/dtBdN (Publisher version) Open Access status unknown

Description:
-

OA-Status:
Not specified

Creators

show

hide

Creators:
Garg, Naveen¹, Author
Vazirani, Vijay V.², Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2External Organizations, ou_persistent22

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 1995

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 517888
Other: Local-ID: C1256428004B93B8-F39300A455CB7479C125645A004342E8-Garg-Vazirani-95
DOI: 10.1007/BF01585926
BibTex Citekey: Garg/Vazirani_MP95

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Mathematical Programming / A

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Heidelberg : North-Holland

Pages: - Volume / Issue: 70 (1) Sequence Number: - Start / End Page: 17 - 25 Identifier: ISSN: 0025-5610
CoNE: https://pure.mpg.de/cone/journals/resource/954928560452