FOCS 2008 - PDF Preprint Papers

FOCS 2008 Annual IEEE Symposium on Foundations of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FOCS-2008 Paper

click to vote

FOCS
2008
IEEE

225views Theoretical Computer Science» more FOCS 2008»

Degree Bounded Network Design with Metric Costs

14 years 6 months ago

Download www.cse.cuhk.edu.hk

Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to ﬁnd a minimum cost simple subgraph with maximum...

Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...

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	225	Degree Bounded Network Design with Metric Costs	claim
2	192	Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph	claim
3	183	Leakage-Resilient Cryptography	claim
4	172	A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match	claim
5	172	Mixing Time of Exponential Random Graphs	claim
6	167	Constant-Time Approximation Algorithms via Local Improvements	claim
7	164	Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents	claim
8	162	Some Results on Greedy Embeddings in Metric Spaces	claim
9	157	Almost-Natural Proofs	claim
10	153	Set Covering with our Eyes Closed	claim
11	151	Near-Optimal Sparse Recovery in the L1 Norm	claim
12	151	What Can We Learn Privately?	claim
13	144	Clock Synchronization with Bounded Global and Local Skew	claim
14	140	Algorithms for Single-Source Vertex Connectivity	claim
15	136	Sketching and Streaming Entropy via Approximation Theory	claim
16	133	Computing the Tutte Polynomial in Vertex-Exponential Time	claim
17	133	Submodular Approximation: Sampling-based Algorithms and Lower Bounds	claim
18	132	A Counterexample to Strong Parallel Repetition	claim
19	132	On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP	claim
20	130	Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums	claim
21	129	Learning Geometric Concepts via Gaussian Surface Area	claim
22	128	Hardness of Nearest Neighbor under L-infinity	claim
23	127	Dense Subsets of Pseudorandom Sets	claim
24	127	Spherical Cubes and Rounding in High Dimensions	claim
25	125	Elections Can be Manipulated Often	claim
26	124	Minimizing Movement in Mobile Facility Location Problems	claim
27	123	Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners	claim
28	119	Dynamic Connectivity: Connecting to Networks and Geometry	claim
29	118	Size Bounds and Query Plans for Relational Joins	claim
30	116	The Power of Reordering for Online Minimum Makespan Scheduling	claim
31	116	Isotropic PCA and Affine-Invariant Clustering	claim
32	115	Arithmetic Circuits: A Chasm at Depth Four	claim
33	115	k-Wise Independent Random Graphs	claim
34	111	Fast Modular Composition in any Characteristic	claim
35	110	Network Extractor Protocols	claim
36	110	Lower Bounds for Noisy Wireless Networks using Sampling Algorithms	claim
37	110	Unique Games with Entangled Provers are Easy	claim
38	110	A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems	claim
39	109	Linear Level Lasserre Lower Bounds for Certain k-CSPs	claim
40	108	Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply	claim
41	106	Hardness of Minimizing and Learning DNF Expressions	claim
42	106	Kakeya Sets, New Mergers and Old Extractors	claim
43	105	On Basing Lower-Bounds for Learning on Worst-Case Assumptions	claim
44	104	Average-case Complexity	claim
45	103	Multi-unit Auctions with Budget Limits	claim
46	102	Broadcasting with Side Information	claim
47	101	Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes	claim
48	101	On the Hardness of Being Truthful	claim
49	99	Truthful Approximation Schemes for Single-Parameter Agents	claim
50	98	The Unbounded-Error Communication Complexity of Symmetric Functions	claim
51	97	A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest	claim
52	97	Noise Tolerance of Expanders and Sublinear Expander Reconstruction	claim
53	97	Two Query PCP with Sub-Constant Error	claim
54	97	Succincter	claim
55	96	Nearly Tight Low Stretch Spanning Trees	claim
56	94	(Data) STRUCTURES	claim
57	91	Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows	claim
58	91	Algorithmic Barriers from Phase Transitions	claim
59	91	Rounding Parallel Repetitions of Unique Games	claim
60	90	Quantum Multi Prover Interactive Proofs with Communicating Provers	claim
61	89	Approximate Kernel Clustering	claim
62	88	Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution	claim
63	85	Entangled Games are Hard to Approximate	claim
64	84	On the Value of Multiple Read/Write Streams for Approximating Frequency Moments	claim
65	82	Matrix Sparsification for Rank and Determinant Computations via Nested Dissection	claim
66	79	The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)	claim
67	72	Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors	claim
68	67	On the Union of Cylinders in Three Dimensions	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers