MFCS 2009 - PDF Preprint Papers

MFCS 2009 International Symposium on Mathematical Foundations of Computer

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed MFCS-2009 Paper

click to vote

MFCS
2009
Springer

214views Theoretical Computer Science» more MFCS 2009»

An Improved Approximation Bound for Spanning Star Forest and Color Saving

14 years 5 months ago

Download www.ceid.upatras.gr

We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...

Stavros Athanassopoulos, Ioannis Caragiannis, Chri...

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	214	An Improved Approximation Bound for Spanning Star Forest and Color Saving	claim
2	157	Query Automata for Nested Words	claim
3	154	A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems	claim
4	150	Synthesis for Structure Rewriting Systems	claim
5	148	Representing Groups on Graphs	claim
6	145	Future-Looking Logics on Data Words and Trees	claim
7	140	The Isomorphism Problem for k-Trees Is Complete for Logspace	claim
8	138	Branching Programs for Tree Evaluation	claim
9	125	Stochastic Games with Finitary Objectives	claim
10	123	Time-Bounded Kolmogorov Complexity and Solovay Functions	claim
11	121	Sampling Edge Covers in 3-Regular Graphs	claim
12	118	The Longest Path Problem Is Polynomial on Interval Graphs	claim
13	118	On the Structure of Optimal Greedy Computation (for Job Scheduling)	claim
14	114	A General Class of Models of	claim
15	113	Private Capacities in Mechanism Design	claim
16	110	Balanced Paths in Colored Graphs	claim
17	110	How to Use Spanning Trees to Navigate in Graphs	claim
18	108	Bounds on Non-surjective Cellular Automata	claim
19	108	Constructing Brambles	claim
20	108	The Expressive Power of Binary Submodular Functions	claim
21	106	Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules	claim
22	103	Parameterized Complexity Classes under Logical Reductions	claim
23	102	FO Model Checking on Nested Pushdown Trees	claim
24	100	Synchronization of Regular Automata	claim
25	100	A Dichotomy Theorem for Polynomial Evaluation	claim
26	100	From Parity and Payoff Games to Linear Programming	claim
27	98	On Pebble Automata for Data Languages with Decidable Emptiness Problem	claim
28	96	Size and Energy of Threshold Circuits Computing Mod Functions	claim
29	94	On the Recognizability of Self-generating Sets	claim
30	94	The Prismoid of Resources	claim
31	94	The Cost of Stability in Network Flow Games	claim
32	92	Self-indexed Text Compression Using Straight-Line Programs	claim
33	88	Snake-Deterministic Tiling Systems	claim
34	85	Stochastic Process Creation	claim
35	83	Regular Expressions with Counting: Weak versus Strong Determinism	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers