English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem

Adamaszek, A., Blin, G., & Popa, A. (2015). Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem. In J. Kratchovíl, M. Miller, & D. Froncek (Eds.), Combinatorial Algorithms (pp. 13-23). Berlin: Springer. doi:10.1007/978-3-319-19315-1_2.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Adamaszek, Anna1, Author           
Blin, Guillaume2, Author
Popa, Alexandru2, 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: 20152015
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: AdamaszekIWOCA2014
DOI: 10.1007/978-3-319-19315-1_2
 Degree: -

Event

show
hide
Title: 25th International Workshop on Combinatorial Algorithms
Place of Event: Duluth, MN, USA
Start-/End Date: 2014-10-15 - 2014-10-17

Legal Case

show

Project information

show

Source 1

show
hide
Title: Combinatorial Algorithms
  Abbreviation : IWOCA 2014
  Subtitle : 25th International Workshop, IWOCA 2014 ; Duluth, MN, USA, October 15 - 17, 2014 ; Revised Selected Papers
Source Genre: Proceedings
 Creator(s):
Kratchovíl, Jan1, Editor
Miller, Mirka1, Editor
Froncek, Dalibor1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 13 - 23 Identifier: ISBN: 978-3-319-19314-4

Source 2

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