Search Sciweavers | Sciweavers

1486 search results - page 23 / 298

» Algorithms for two-box covering

click to vote

MFCS
1999
Springer

71views Theoretical Computer Science» more MFCS 1999»

An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover

15 years 7 months ago

Download theinf1.informatik.uni-jena.de

Henning Fernau, Rolf Niedermeier

claim paper

Read More »

117

click to vote

FOCS
1991
IEEE

114views Theoretical Computer Science» more FOCS 1991»

Fast Approximation Algorithms for Fractional Packing and Covering Problems

15 years 6 months ago

Download infolab.stanford.edu

Serge A. Plotkin, David B. Shmoys, Éva Tard...

claim paper

Read More »

100

click to vote

ALENEX
2004

99views Algorithms» more ALENEX 2004»

Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments

15 years 4 months ago

Download www.cs.utk.edu

d Abstract) Faisal N. Abu-Khzam , Rebecca L. Collins , Michael R. Fellows , Michael A. Langston , W. Henry Suters and Chris T. Symons

Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R...

claim paper

Read More »

click to vote

ALGORITHMICA
2008

59views more ALGORITHMICA 2008»

An Optimal Algorithm for the Minimum Disc Cover Problem

15 years 3 months ago

Download cgm.cs.ntust.edu.tw

Min-Te Sun, Chih-Wei Yi, Chuan-Kai Yang, Ten-Hwang...

claim paper

Read More »

Voted

IPL
2008

58views more IPL 2008»

Two fixed-parameter algorithms for Vertex Covering by Paths on Trees

15 years 2 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers