ICALP 2005 - PDF Preprint Papers

ICALP 2005 International Colloquium on Automata

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICALP-2005 Paper

click to vote

ICALP
2005
Springer

173views Programming Languages» more ICALP 2005»

Approximation Algorithms for the Max-coloring Problem

13 years 10 months ago

Download web.sau.edu

Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to ﬁnd a proper vertex coloring of G whose color classes C1, C2, . . . ,...

Sriram V. Pemmaraju, Rajiv Raman

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	173	Approximation Algorithms for the Max-coloring Problem	claim
2	163	A Better Approximation Ratio for the Vertex Cover Problem	claim
3	162	About Hoare Logics for Higher-Order Store	claim
4	160	Approximation Algorithms for Euclidean Group TSP	claim
5	157	Recursive Markov Decision Processes and Recursive Stochastic Games	claim
6	153	Computationally Sound Implementations of Equational Theories Against Passive Adversaries	claim
7	151	Hierarchical Group Signatures	claim
8	139	Union-Find with Constant Time Deletions	claim
9	139	Facility Location in Sublinear Time	claim
10	139	Optimal Spaced Seeds for Faster Approximate String Matching	claim
11	139	Logics for Unranked Trees: An Overview	claim
12	136	Decidability and Complexity Results for Timed Automata via Channel Machines	claim
13	136	Spatial Logics for Bigraphs	claim
14	136	On Dynamic Bit-Probe Complexity	claim
15	136	Computational Bounds on Hierarchical Data Processing with Applications to Information Security	claim
16	135	Linear Time Algorithms for Clustering Problems in Any Dimensions	claim
17	133	Noisy Turing Machines	claim
18	131	Combining Intruder Theories	claim
19	131	Single-Key AIL-MACs from Any FIL-MAC	claim
20	131	Basing Cryptographic Protocols on Tamper-Evident Seals	claim
21	127	Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins	claim
22	126	Online Interval Coloring and Variants	claim
23	126	Completely Non-malleable Schemes	claim
24	125	Weighted Automata and Weighted Logics	claim
25	123	Simple Extractors via Constructions of Cryptographic Pseudo-random Generators	claim
26	121	Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity	claim
27	121	Basic Observables for a Calculus for Global Computing	claim
28	120	The Complexity of Stochastic Rabin and Streett Games'	claim
29	117	New Approaches for Virtual Private Network Design	claim
30	116	On the Cover Time of Random Geometric Graphs	claim
31	116	The Tree Inclusion Problem: In Optimal Space and Faster	claim
32	116	The Generalized Deadlock Resolution Problem	claim
33	113	How Well Can Primal-Dual and Local-Ratio Algorithms Perform?	claim
34	113	A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines	claim
35	110	On Steganographic Chosen Covertext Security	claim
36	109	Preservation Under Extensions on Well-Behaved Finite Structures	claim
37	109	The Polyranking Principle	claim
38	108	Password-Based Encryption Analyzed	claim
39	108	Boneh-Franklin Identity Based Encryption Revisited	claim
40	108	Quantum Complexity of Testing Group Commutativity	claim
41	107	Cache-Aware and Cache-Oblivious Adaptive Sorting	claim
42	107	Decidability in Syntactic Control of Interference	claim
43	105	Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines	claim
44	105	Fast Neighbor Joining	claim
45	105	All Quantum Adversary Methods Are Equivalent	claim
46	103	Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval	claim
47	102	On the Wake-Up Problem in Radio Networks	claim
48	102	Append-Only Signatures	claim
49	102	Orthogonal Extensions in Structural Operational Semantics	claim
50	100	Idealized Algol with Ground Recursion, and DPDA Equivalence	claim
51	99	Petri Algebras	claim
52	97	Dynamic Bin Packing of Unit Fractions Items	claim
53	95	Optimal Cover Time for a Graph-Based Coupon Collector Process	claim
54	95	A Finite Basis for Failure Semantics	claim
55	94	Probabilistic Polynomial-Time Semantics for a Protocol Security Logic	claim
56	93	Optimal In-place Sorting of Vectors and Records	claim
57	92	Worst Case Optimal Union-Intersection Expression Evaluation	claim
58	91	Optimistic Asynchronous Atomic Broadcast	claim
59	90	Discrete Random Variables over Domains	claim
60	86	Tight Lower Bounds for Query Processing on Streaming and External Memory Data	claim
61	81	Up-to Techniques for Weak Bisimulation	claim
62	78	Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture	claim
63	78	Single-Database Private Information Retrieval with Constant Communication Rate	claim
64	78	Stochastic Steiner Trees Without a Root	claim
65	78	Unsafe Grammars and Panic Automata	claim
66	72	Randomized Fast Design of Short DNA Words	claim
67	68	Measure and Conquer: Domination - A Case Study	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers