251 search results - page 31 / 51 » Polynomial Time Algorithms for Three-Label Point Labeling |
126
Voted
STOC
2005
ACM
16 years 2 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
148
click to vote
CATS
2008
15 years 3 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
127
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
116
Voted
ECCC
2006
15 years 2 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...