ICALP 2001 - PDF Preprint Papers

ICALP 2001 International Colloquium on Automata

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICALP-2001 Paper

click to vote

ICALP
2001
Springer

194views Programming Languages» more ICALP 2001»

Approximating the Minimum Spanning Tree Weight in Sublinear Time

14 years 3 months ago

Download www.cs.princeton.edu

We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...

Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	194	Approximating the Minimum Spanning Tree Weight in Sublinear Time	claim
2	177	Approximation Algorithms for Partial Covering Problems	claim
3	161	Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness	claim
4	141	Communication Gap for Finite Memory Devices	claim
5	119	Symbolic Trace Analysis of Cryptographic Protocols	claim
6	119	Secure Games with Polynomial Expressions	claim
7	116	A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines	claim
8	115	Separating Quantum and Classical Learning	claim
9	113	On the Approximability of Average Completion Time Scheduling under Precedence Constraints	claim
10	111	An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS	claim
11	107	Permutation Editing and Matching via Embeddings	claim
12	106	The Complexity of Computing the Size of an Interval	claim
13	105	Combinatorics of Periods in Strings	claim
14	104	Testing Hypergraph Coloring	claim
15	102	On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities	claim
16	102	Distributed Controller Synthesis for Local Specifications	claim
17	100	Secure Multiparty Computation of Approximations	claim
18	98	Routing in Trees	claim
19	97	Rational Transformations of Formal Power Series	claim
20	94	On Interactive Proofs with a Laconic Prover	claim
21	93	Hidden Pattern Statistics	claim
22	92	Improved Lower Bounds on the Randomized Complexity of Graph Properties	claim
23	90	Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct	claim
24	87	Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution	claim
25	86	Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems	claim
26	85	Online Packet Routing on Linear Arrays and Rings	claim
27	84	A Framework for Index Bulk Loading and Dynamization	claim
28	81	Effective Lossy Queue Languages	claim
29	70	The Complexity of Constructing Evolutionary Trees Using Experiments	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers