STACS 2005 - PDF Preprint Papers

STACS 2005 Annual Symposium on Theoretical Aspects of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STACS-2005 Paper

click to vote

STACS
2005
Springer

165views Theoretical Computer Science» more STACS 2005»

Cycle Cover with Short Cycles

13 years 10 months ago

Download people.csail.mit.edu

Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...

Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...

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	165	Cycle Cover with Short Cycles	claim
2	153	Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics	claim
3	144	Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations	claim
4	142	Exact Quantum Algorithms for the Leader Election Problem	claim
5	138	Approximate Range Mode and Range Median Queries	claim
6	135	How Common Can Be Universality for Cellular Automata?	claim
7	129	A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs	claim
8	125	Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods	claim
9	123	Centrality Measures Based on Current Flow	claim
10	122	The Core of a Countably Categorical Structure	claim
11	117	Dynamic Complexity Theory Revisited	claim
12	115	Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes	claim
13	114	Improved Algorithms for Dynamic Page Migration	claim
14	110	All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time	claim
15	110	Automorphisms of Finite Rings and Applications to Complexity of Problems	claim
16	110	Algorithmics in Exponential Time	claim
17	109	Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size	claim
18	108	Minimizing NFA's and Regular Expressions	claim
19	107	Speed Scaling to Manage Temperature	claim
20	102	Information Theory in Property Testing and Monotonicity Testing in Higher Dimension	claim
21	102	Connectivity for Wireless Agents Moving on a Cycle or Grid	claim
22	98	Robust Polynomials and Quantum Algorithms	claim
23	96	Kolmogorov-Loveland Randomness and Stochasticity	claim
24	95	Cost Sharing and Strategyproof Mechanisms for Set Cover Games	claim
25	94	Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms	claim
26	93	Increasing Kolmogorov Complexity	claim
27	93	Solving Medium-Density Subset Sum Problems in Expected Polynomial Time	claim
28	93	Quantum Interactive Proofs with Competing Provers	claim
29	92	Pattern Occurrences in Multicomponent Models	claim
30	91	Fast Pruning of Geometric Spanners	claim
31	86	On the Decidability of Temporal Properties of Probabilistic Pushdown Automata	claim
32	83	Roundings Respecting Hard Constraints	claim
33	69	Deciding Properties of Contract-Signing Protocols	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers