2957 search results - page 113 / 592 » The Complexity of Polynomial-Time Approximation |
113
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
The medial axis of a shape is known to carry a lot of information about it. In particular a recent result of Lieutier establishes that every bounded open subset of Rn has the same...
119
Voted
ALGOSENSORS
2008
Springer
15 years 5 months ago
2008
Springer
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
143
click to vote
TAMC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
128
click to vote
CC
2006
Springer
15 years 3 months ago
2006
Springer
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...
120
click to vote
SOFSEM
2009
Springer
16 years 1 days ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...