1729 search results - page 64 / 346 » On Bounds for the k-Partitioning of Graphs |
IMA
2001
Springer
15 years 2 months ago
2001
Springer
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
FOCS
2006
IEEE
15 years 4 months ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
WINE
2009
Springer
15 years 4 months ago
2009
Springer
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
