English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. Item Summary / 
  2. View item

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  A New Algorithm for the Hypergraph Transversal Problem

Khachiyan, L., Boros, E., Elbassioni, K., & Gurvich, V. (2005). A New Algorithm for the Hypergraph Transversal Problem. In Computing and combinatorics: 11th Annual International Conference, COCOON 2005 (pp. 767-776). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-25A7-C Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-25A9-8
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Khachiyan, Leonid, Author
Boros, Endre, Author
Elbassioni, Khaled1, Author           
Gurvich, Vladimir, Author
Wang, Lusheng, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2006-04-202005
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 279148
Other: Local-ID: C1256428004B93B8-D8FC10A423BB59A3C125714600385540-Elbassioni2005d
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Kunming, China
Start-/End Date: 2005-08-16

Legal Case

show

Project information

show

Source 1

show
hide
Title: Computing and combinatorics : 11th Annual International Conference, COCOON 2005
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 767 - 776 Identifier: ISBN: 3-540-28061-8

Source 2

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