Print
Lupa

Show document

A- | A+ | Print
Title:The minimum conflict-free row split problem revisited
Authors:Hujdurović, Ademir (Author)
Husić, Edin (Author)
Milanič, Martin (Author)
Rizzi, Romeo (Author)
Tomescu, Alexandru I. (Author)
Files:URL https://doi.org/10.1007/978-3-319-68705-6_23
 
URL https://doi.org/10.1007/978-3-319-68705-6_23
 
Language:English
Work type:Unknown
Tipology:1.08 - Published Scientific Conference Contribution
Organization:IAM - Andrej Marušič Institute
Keywords:#the #minimum conflict-free row split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness
Year of publishing:2016
Number of pages:Str. 303-315
UDC:519.17:004
ISSN on article:0302-9743
COBISS_ID:1539850692 Link is opened in a new window
DOI:10.1007/978-3-319-68705-6_23 Link is opened in a new window
Views:828
Downloads:196
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:Document is not linked to any category.
:
  
Average score:(0 votes)
Your score:Voting is allowed only to logged in users.
Share:Bookmark and Share

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a proceedings

Title:Graph-theoretic concepts in computer science
COBISS.SI-ID:1539850180 This link opens in a new window

Record is a part of a journal

Title:Lecture notes in computer science
Shortened title:Lect. notes comput. sci.
Publisher:Springer
ISSN:0302-9743
COBISS.SI-ID:4292374 This link opens in a new window

Secondary language

Language:English
Keywords:problem najmanjšega brezkonfliktnega razcepa vrstic, razvejanje, Dilwortov izrek, min-max izrek, aproksimacijski algoritem, APX kompleksnost

Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica