COCOON 2007 - PDF Preprint Papers

COCOON 2007 International Conference on Computing and Combinatorics

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COCOON-2007 Paper

click to vote

COCOON
2007
Springer

158views Combinatorics» more COCOON 2007»

Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families

13 years 10 months ago

Download math.la.asu.edu

We give eﬃcient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...

Andrzej Czygrinow, Michal Hanckowiak

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	158	Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families	claim
2	144	Colored Simultaneous Geometric Embeddings	claim
3	141	An Improved Algorithm for Online Unit Clustering	claim
4	137	An Improved Exact Algorithm for Cubic Graph TSP	claim
5	134	Connected Coloring Completion for General Graphs: Algorithms and Complexity	claim
6	134	Improved Exact Algorithms for Counting 3- and 4-Colorings	claim
7	133	Seed-Based Exclusion Method for Non-coding RNA Gene Search	claim
8	123	Finding Equilibria in Games of No Chance	claim
9	114	Can a Graph Have Distinct Regular Partitions?	claim
10	113	Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks	claim
11	111	The Informational Content of Canonical Disjoint NP-Pairs	claim
12	105	Generating Minimal k-Vertex Connected Spanning Subgraphs	claim
13	104	Information Distance from a Question to an Answer	claim
14	104	On the Complexity of Finding an Unknown Cut Via Vertex Queries	claim
15	102	On the Hardness of Optimization in Power Law Graphs	claim
16	98	Streaming Algorithms Measured in Terms of the Computed Quantity	claim
17	96	Properties of Symmetric Incentive Compatible Auctions	claim
18	94	Isolation Concepts for Enumerating Dense Subgraphs	claim
19	94	On the Number of Cycles in Planar Graphs	claim
20	92	Dimension, Halfspaces, and the Density of Hard Sets	claim
21	91	Priority Algorithms for the Subset-Sum Problem	claim
22	91	"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas	claim
23	87	Online Interval Scheduling: Randomized and Multiprocessor Cases	claim
24	87	Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games	claim
25	87	Online Frequency Assignment in Wireless Communication Networks	claim
26	87	Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs	claim
27	87	Scheduling Selfish Tasks: About the Performance of Truthful Algorithms	claim
28	82	Efficient Testing of Forecasts	claim
29	79	Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers