ǂThe ǂminimum conflict-free row split problem revisited
Abstract
The minimum conflict-free row split problem revisited
Keywords
ǂthe ǂminimum conflict-free row split problem;branching;Dilworth's theorem;min-max theorem;approximation algorithm;APX-hardness;
Data
| Language: | English |
|---|---|
| Year of publishing: | 2016 |
| Typology: | 1.08 - Published Scientific Conference Contribution |
| Organization: | UP - University of Primorska |
| UDC: | 519.17:004 |
| COBISS: |
1539850692
|
| ISSN: | 0302-9743 |
| Views: | 2488 |
| Downloads: | 275 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| Secondary language: | English |
|---|---|
| Secondary keywords: | problem najmanjšega brezkonfliktnega razcepa vrstic;razvejanje;Dilwortov izrek;min-max izrek;aproksimacijski algoritem;APX kompleksnost; |
| Type (COBISS): | Not categorized |
| Pages: | Str. 303-315 |
| DOI: | 10.1007/978-3-319-68705-6_23 |
| ID: | 10879748 |
Recommended works:
ǂThe ǂminimum conflict-free row split problem revisited
2016,
no subtitle data available
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
2018,
no subtitle data available
Reconstructing perfect phylogenies via branchings in acyclic digraphs
2020,
ǂa ǂnew lower bound and efficiently solvable cases
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
2017,
no subtitle data available
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
2018,
no subtitle data available