Search Sciweavers | Sciweavers

We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...

Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong C...

claim paper

Read More »

106

click to vote

JCSS
2008

64views more JCSS 2008»

Tight approximation algorithm for connectivity augmentation problems

15 years 3 months ago

Download www.openu.ac.il

Guy Kortsarz, Zeev Nutov

claim paper

Read More »

108

click to vote

JDA
2008

60views more JDA 2008»

A 3-approximation algorithm for the subtree distance between phylogenies

15 years 3 months ago

Download www.dur.ac.uk

Magnus Bordewich, Catherine McCartin, Charles Semp...

claim paper

Read More »

click to vote

CSDA
2007

69views more CSDA 2007»

Algorithms and applications for approximate nonnegative matrix factorization

15 years 3 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers