Pierluigi Crescenzi, Luca Trevisan  Home/Search
Context
Related
| columbia.edu/~luca/p...VertexCover.ps.Z berkeley.edu/~luca/p...VertexCover.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: columbia.edu/~luca/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . In this paper we study the problem of computing approximate vertex covers of a graph on the basis of partial information and we consider the distributed decision-making and the communication complexity frameworks. In the first framework we do not allow communication among the processors: in this case, we show an optimal algorithm whose performance ratio is equal to p where p is the number of processors. In the second framework two processors are allowed to communicate in order to find an... (Update)
Similar documents (at the sentence level):
14.7%: On the Distributed Decision-Making Complexity of the.. - Crescenzi, Trevisan (1995) (Correct)
Active bibliography (related documents): More All
0.9: Special Purpose Parallel Computing - McColl (1993) (Correct)
0.4: Tight Bounds on the Cumulative Profit of Distributed Voters - Auer, Caianiello.. (1996) (Correct)
0.3: On Communication Games with More Than Two Players - Jukna (1995) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.2: To Weight or not to Weight: Where is the Question? - Crescenzi, Silvestri, Trevisan (1996) (Correct)
0.2: On Approximation Scheme Preserving Reducibility and its.. - Crescenzi, Trevisan (1995) (Correct)
0.2: On Approximation Scheme Preserving Reducibility and Its.. - Crescenzi, Trevisan (1994) (Correct)
BibTeX entry: (Update)
@misc{ crescenzi-minimum,
author = "Pierluigi Crescenzi and Luca Trevisan",
title = "Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity
(Extended Abstract)",
url = "citeseer.ist.psu.edu/94632.html" }
Citations (may not include all citations):4212 Computers and Intractability. A Guide to the Theory of NP-co.. (context) - Garey, Johnson - 1979
773 Reducibility among combinatorial problems (context) - Karp - 1972
182 Algebraic Coding Theory (context) - Berlekamp - 1968
166 Some complexity questions related to distributive computing (context) - Yao
82 Monotone circuits for connectivity require super-logarithmic.. (context) - Karchmer, Wigderson - 1988
66 Complexity classes in communication complexity theory (context) - Babai, Frankl et al. - 1986
64 Area-time complexity for VLSI (context) - Thompson - 1979
54 Las Vegas is better than determinism in VLSI and distributed.. (context) - Melhorn, Schmidt - 1982
44 Communication complexity (context) - Papadimitriou, Sipser - 1982
35 On notions of information transfer in VLSI circuits (context) - Aho, Ullman et al. - 1983
30 Lecture notes on approximation algorithms (context) - Motwani - 1992
25 Expressing combinatorial optimization problems by linear pro.. (context) - Yannakakis - 1988
22 Lower bounds for VLSI (context) - Lipton, Sedgewick - 1981
19 Linear programming without the matrix (context) - Papadimitriou, Yannakakis - 1993
16 Probabilistic communication complexity (context) - Paturi, Simon - 1986
16 The entropic limitations of VLSI computation (context) - Yao - 1981
15 the value of information in distributed decision making (context) - Papadimitriou, Yannakakis - 1991
6 The value of information (context) - Papadimitriou - 1992
5 A comparison of signaling alphabets (context) - Gilbert - 1952
4 The VLSI complexity of selected graph problems (context) - Ja'Ja' - 1984
3 Distributed decision-making with incomplete information (context) - Deng, Papadimitriou - 1992
2 Solving undirected graph problems on VLSI (context) - Hambrusch, Simon - 1985
Documents on the same site (http://www.cs.columbia.edu/~luca/papers.html): More
Constraint Satisfaction: The Approximability of.. - Khanna, Sudan, Trevisan (1997) (Correct)
A Complexity Analysis of Bisimilarity for Value-Passing.. - Boreale, Trevisan (1996) (Correct)
On Approximation Scheme Preserving Reducibility and its.. - Crescenzi, Trevisan (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC