Asymmetric K-Center Is Log* N-Hard to Approximate

Journal of the ACM - United States
doi 10.1145/1082036.1082038
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computing Machinery (ACM)

Related search

The Shortest Vector in a Lattice Is Hard to Approximate to Within Some Constant

SIAM Journal on Computing
MathematicsComputer Science
2001English

Undirected Graph Exploration With ⊝(log Log N) Pebbles

2015English

Constructing O(n Log N) Size Monotone Formulae for the K-Th Elementary Symmetric Polynomial of N Boolean Variables

English

Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Sometimes Treatment Is Hard to Swallow

Caring for the Ages
2016English

The 10 GHz Log N - Log S Curve Obtained at NRO

Symposium - International Astronomical Union
1987English

Cordial Labelling of K-Regular Bipartite Graphs for K = 1, 2, N, N-1 Where K Is Cardinality of Each Bipartition

IOSR Journal of Mathematics
2013English

An O(N Log N) Algorithm for Shape Modeling.

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
1996English

Approximate Spatio-Temporal Top-K Publish/Subscribe

World Wide Web
HardwareComputer NetworksSoftwareArchitectureCommunications
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy