Search Sciweavers | Sciweavers

16

STOC
1994
ACM

97views Algorithms» more STOC 1994»

An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane

13 years 11 months ago

Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...

Naveen Garg, Dorit S. Hochbaum

claim paper

Read More »

24

click to vote

SWAT
2000
Springer

94views Algorithms» more SWAT 2000»

Embeddings of k-Connected Graphs of Pathwidth k

13 years 11 months ago

Download www.cs.sfu.ca

Arvind Gupta, Naomi Nishimura, Andrzej Proskurowsk...

claim paper

Read More »

27

click to vote

COMBINATORICS
2006

107views more COMBINATORICS 2006»

On the Symmetry of the Distribution of k-Crossings and k-Nestings in Graphs

13 years 7 months ago

Download www.emis.de

This note contains two results on the distribution of k-crossings and k-nestings in graphs. On the positive side, we exhibit a class of graphs for which there are as many k-noncro...

Anna de Mier

claim paper

Read More »

15

click to vote

INFORMS
2006

65views more INFORMS 2006»

The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3

13 years 7 months ago

Download www.or.rwth-aachen.de

Stefan Irnich, Daniel Villeneuve

claim paper

Read More »

27

click to vote

CIKM
2011
Springer

211views Information Technology» more CIKM 2011»

S3K: seeking statement-supporting top-K witnesses

12 years 7 months ago

Download www.mpi-inf.mpg.de

Traditional information retrieval techniques based on keyword search help to identify a ranked set of relevant documents, which often contains many documents in the top ranks that...

Steffen Metzger, Shady Elbassuoni, Katja Hose, Ral...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers