English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  On minimum 3-cuts and approximating k-cuts using cut trees

Kapoor, S. (1996). On minimum 3-cuts and approximating k-cuts using cut trees. In W. H. Cunningham, T. S. McCormick, & M. Queyranne (Eds.), Integer Programming and Combinatorial Optimization: International Conference (IPCO-5) (pp. 132-146). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AB8F-B Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AB90-5
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Kapoor, Sanjiv1, 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-021996
 Publication Status: Issued
 Pages: -
 Publishing info: Berlin, Germany : Springer
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517834
Other: Local-ID: C1256428004B93B8-B0AFADBE3F8C9487C12564660055EF0A-Kapoor96
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Vancouver, BC, Canada
Start-/End Date: 1996

Legal Case

show

Project information

show

Source 1

show
hide
Title: Integer Programming and Combinatorial Optimization : International Conference (IPCO-5)
Source Genre: Proceedings
 Creator(s):
Cunningham, William H., Editor
McCormick, Thomas S., Editor
Queyranne, Maurice, Editor
Affiliations:
-
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 132 - 146 Identifier: -

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -