Maximum independent set for intervals by divide and conquer with pruning

Suppose a given set of n intervals contains a maximum independent set of k disjoint intervals. This brief note demonstrates that “divide and conquer with pruning” produces an easy, output‐sensitive O(n log k)‐time algorithm to compute such a maximum independent set. © 2006 Wiley Periodicals, Inc. NE...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Networks Ročník 49; číslo 2; s. 158 - 159
Hlavní autor: Snoeyink, Jack
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.03.2007
John Wiley & Sons
Témata:
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
divide and conquer
Exact sciences and technology
interval graph
maximum independent set
output-sensitive algorithm
Software
Interval graph
Filtering
Independent set
Pruning(tree)
divide and conquer
maximum independent set
Divide and conquer method
output- sensitive algorithm
ISSN:0028-3045, 1097-0037
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Suppose a given set of n intervals contains a maximum independent set of k disjoint intervals. This brief note demonstrates that “divide and conquer with pruning” produces an easy, output‐sensitive O(n log k)‐time algorithm to compute such a maximum independent set. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 49(2), 158–159 2007
Bibliografie:ArticleID:NET20150
ark:/67375/WNG-RC6GR6Z7-W
istex:144454F97E89989242E997B60BD48D785E09BEE4
NGA/Darpa - No. HM1582-05-2-0003
NSF - No. 0086013; No. 0429901
ISSN:0028-3045
1097-0037
DOI:10.1002/net.20150