English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Dependent Randomized Rounding: The Bipartite Case

Doerr, B., Künnemann, M., & Wahlström, M. (2011). Dependent Randomized Rounding: The Bipartite Case. In M. Müller-Hannemann, & R. Werneck (Eds.), 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (pp. 96-106). Philadelphia, PA: SIAM. doi:10.1137/1.9781611972917.10.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Doerr, Benjamin1, Author           
Künnemann, Marvin1, Author           
Wahlström, Magnus1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20112011
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 618653
DOI: 10.1137/1.9781611972917.10
Other: Local-ID: C1256428004B93B8-6E21D98FD25D4E01C125781800410717-DKW2011
 Degree: -

Event

show
hide
Title: Thirteenth Workshop on Algorithm Engineering and Experiments
Place of Event: San Francisco, California, USA
Start-/End Date: 2011-01-22 - 2011-01-22

Legal Case

show

Project information

show

Source 1

show
hide
Title: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments
  Abbreviation : ALENEX 2011
Source Genre: Proceedings
 Creator(s):
Müller-Hannemann, Matthias1, Editor
Werneck, Renato1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 96 - 106 Identifier: ISBN: 978-0-898719-31-4