STOC 2007 - PDF Preprint Papers

STOC 2007 Annual ACM Symposium on Theory of Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STOC-2007 Paper

click to vote

STOC
2007
ACM

239views Algorithms» more STOC 2007»

Approximating minimum bounded degree spanning trees to within one of optimal

14 years 11 months ago

Download www.andrew.cmu.edu

In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...

Mohit Singh, Lap Chi Lau

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	239	Approximating minimum bounded degree spanning trees to within one of optimal	claim
2	181	How to rank with few errors	claim
3	179	Towards 3-query locally decodable codes of subexponential length	claim
4	169	Proportional response dynamics leads to market equilibrium	claim
5	164	An approximation algorithm for max-min fair allocation of indivisible goods	claim
6	164	All-pairs bottleneck paths for general graphs in truly sub-cubic time	claim
7	154	Improved approximation for directed cut problems	claim
8	146	Playing games with approximation algorithms	claim
9	142	Lower bounds for randomized read/write stream algorithms	claim
10	140	On the submodularity of influence in social networks	claim
11	137	Testing k-wise and almost k-wise independence	claim
12	136	Exponential separations for one-way quantum communication complexity, with applications to cryptography	claim
13	134	Hardness of routing with congestion in directed graphs	claim
14	133	Interpolation of depth-3 arithmetic circuits with two multiplication gates	claim
15	132	On the convergence of Newton's method for monotone systems of polynomial equations	claim
16	128	Iteratively constructing preconditioners via the conjugate gradient method	claim
17	127	First to market is not everything: an analysis of preferential attachment with fitness	claim
18	123	A 3-query PCP over integers	claim
19	121	An efficient parallel repetition theorem for Arthur-Merlin games	claim
20	120	Approximation algorithms for budgeted learning problems	claim
21	119	Balanced max 2-sat might not be the hardest	claim
22	117	A combinatorial, primal-dual approach to semidefinite programs	claim
23	117	Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut	claim
24	116	Lower bounds for 2-dimensional range counting	claim
25	116	Statistically-hiding commitment from any one-way function	claim
26	116	On achieving the "best of both worlds" in secure multiparty computation	claim
27	112	Smooth sensitivity and sampling in private data analysis	claim
28	111	Low-end uniform hardness vs. randomness tradeoffs for AM	claim
29	110	Randomly coloring planar graphs with fewer colors than the maximum degree	claim
30	109	Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads	claim
31	108	Some new results on node-capacitated packing of A-paths	claim
32	108	Combinatorial complexity in O-minimal geometry	claim
33	106	One sketch for all: fast algorithms for compressed sensing	claim
34	105	Balanced allocations: the weighted case	claim
35	104	Simple deterministic approximation algorithms for counting matchings	claim
36	104	Holographic algorithms: from art to science	claim
37	104	Optimal suffix selection	claim
38	102	Zero-knowledge from secure multiparty computation	claim
39	101	Inapproximability of the Tutte polynomial	claim
40	101	The price of privacy and the limits of LP decoding	claim
41	101	Toward a general theory of quantum games	claim
42	100	Reordering buffers for general metric spaces	claim
43	100	Linear probing with constant independence	claim
44	98	Negative weights make adversaries stronger	claim
45	97	Uncertainty principles, extractors, and explicit embeddings of l2 into l1	claim
46	97	Search via quantum walk	claim
47	94	Sampling-based dimension reduction for subspace approximation	claim
48	94	Constructing non-computable Julia sets	claim
49	93	Degree-constrained network flows	claim
50	92	Tight bounds for asynchronous randomized consensus	claim
51	92	Parallel repetition: simplifications and the no-signaling case	claim
52	92	Terminal backup, 3D matching, and covering cubic graphs	claim
53	91	Polynomial flow-cut gaps and hardness of directed cut problems	claim
54	87	The communication complexity of uncoupled nash equilibrium procedures	claim
55	85	Local embeddings of metric spaces	claim
56	85	Faster integer multiplication	claim
57	84	Lower bounds in communication complexity based on factorization norms	claim
58	83	Lattices that admit logarithmic worst-case to average-case connection factors	claim
59	83	Verifying and decoding in constant depth	claim
60	82	Interval completion with few edges	claim
61	71	Survivable network design with degree or order constraints	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers