SIAMCOMP 2008 - PDF Preprint Papers

SIAMCOMP 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SIAMCOMP-2008 Paper

click to vote

SIAMCOMP
2008

167views more SIAMCOMP 2008»

Approximation Algorithms for Data Placement Problems

14 years 7 days ago

Download www.ccs.neu.edu

We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...

Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy

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	167	Approximation Algorithms for Data Placement Problems	claim
2	154	Cryptography in the Bounded-Quantum-Storage Model	claim
3	148	The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement	claim
4	140	The Forgetron: A Kernel-Based Perceptron on a Budget	claim
5	137	Approximate Shortest Paths in Anisotropic Regions	claim
6	133	A Deterministic Subexponential Algorithm for Solving Parity Games	claim
7	132	An APTAS for Generalized Cost Variable-Sized Bin Packing	claim
8	131	Special Issue on Foundations of Computer Science	claim
9	130	Short PCPs with Polylog Query Complexity	claim
10	124	A Faster, Better Approximation Algorithm for the Minimum Latency Problem	claim
11	123	Approximation Algorithms for Biclustering Problems	claim
12	121	Closest Substring Problems with Small Distances	claim
13	113	Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography	claim
14	109	On Monotone Formula Composition of Perfect Zero-Knowledge Languages	claim
15	108	A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover	claim
16	108	The Euclidean Orienteering Problem Revisited	claim
17	107	Holographic Algorithms	claim
18	104	A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game	claim
19	103	Compression in Finite Fields and Torus-Based Cryptography	claim
20	101	Combination Can Be Hard: Approximability of the Unique Coverage Problem	claim
21	100	On the Complexity of Verifying Consistency of XML Specifications	claim
22	95	On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model	claim
23	86	The Complexity of Monadic Second-Order Unification	claim
24	84	Resolution Is Not Automatizable Unless W[P] Is Tractable	claim
25	80	The Symmetric Group Defies Strong Fourier Sampling	claim
26	79	Vertical Ray Shooting and Computing Depth Orders for Fat Objects	claim
27	78	I/O-Efficient Planar Separators	claim
28	77	A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights	claim
29	75	Splitting NP-Complete Sets	claim
30	75	Graph Distances in the Data-Stream Model	claim
31	72	Plottable Real Number Functions and the Computable Graph Theorem	claim
32	72	Query-Efficient Algorithms for Polynomial Interpolation over Composites	claim
33	70	Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems	claim
34	65	Exact Algorithms for Treewidth and Minimum Fill-In	claim
35	63	Uniform Hashing in Constant Time and Optimal Space	claim
36	60	Improved Approximation Algorithms for Minimum Weight Vertex Separators	claim
37	49	Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements	claim
38	45	Testing Graph Isomorphism	claim
39	45	The Spectral Method for General Mixture Models	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers