English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  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.

Item is

 

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/11858/00-001M-0000-0014-AC62-5
Genre: Journal Article

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Garg, Naveen1, Author           
Vazirani, Vijay V., Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021995
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 517888
Other: Local-ID: C1256428004B93B8-F39300A455CB7479C125645A004342E8-Garg-Vazirani-95
 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: -
Pages: - Volume / Issue: 70 (1) Sequence Number: - Start / End Page: 17 - 25 Identifier: ISSN: 0025-5610