Sciweavers

1672 search results - page 5 / 335
» Tightness problems in the plane
Sort
View
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 24 days ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
CORR
2008
Springer
169views Education» more  CORR 2008»
13 years 7 months ago
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
Mingyu Xiao, Leizhen Cai, Andrew C. Yao
IPCO
1992
115views Optimization» more  IPCO 1992»
13 years 8 months ago
When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?
We consider the probabilistic relationship between the value of a random asymmetric traveling salesman problem ATSP(M) and the value of its assignment relaxation AP(M). We assume ...
Alan M. Frieze, Richard M. Karp, Bruce A. Reed
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
11 years 10 months ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
COMPGEOM
1994
ACM
13 years 11 months ago
Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...
Dan Halperin, Micha Sharir