佳能5D4搭配24-70镜头现货销售
配EF24-70F2.8头 佳能5D IV套机29999
佳能EOS 5D Mark IV就果真引入了触屏操控，但不同与EOS-1D X Mark II的触控功能，佳能EOS 5D Mark IV要更为先进和方便，因为触控并不只限于LV实时取景下进行触屏对焦和触屏快门，同时还支援菜.....&nbsp&nbsp&nbsp&nbsp
&nbsp&nbsp&nbsp 佳能品牌近期推出了该品牌最新一代旗舰机佳能5D Mark IV。佳能5D Mark IV一上市就凭借出色的性能，以及才操作方面的完美延续得到了广大消费者的一致好评。目前佳能5D Mark IV已经正式到货沈阳，笔者从经销商处获悉，以佳能5D Mark IV为主体的套机佳能5D Mark IV（EF24-70F2.8）售价仅为29999元，需要的朋友千万不要错过了。
佳能5D Mark IV
&nbsp&nbsp&nbsp 佳能EOS 5D Mark IV就果真引入了触屏操控，但不同与EOS-1D X Mark II的触控功能，佳能EOS 5D Mark IV要更为先进和方便，因为触控并不只限于LV实时取景下进行触屏对焦和触屏快门，同时还支援菜单选项的控制，以及回放照片时图片切换及双指放大/缩小等操作，灵活性更高。
佳能5D Mark IV
&nbsp&nbsp&nbsp 佳能EOS 5D Mark IV的按键布局跟上代相似，完全不需要重新适应，即时就可以上手，但为了加强对焦模式切换的便利性，佳能这次给EOS 5D Mark IV机背的多功能控制摇杆右下方新增加了一个自动对焦区域选择按钮，并且也可以自定义为其他功能。
佳能5D Mark IV
&nbsp&nbsp&nbsp 佳能 EOS 5D Mark IV采用了一块全新的3040万有效像素的全画幅CMOS传感器。此外，新相机视频方面也加入了4K的录制能力。而更多实用的功能如全像素双核CMOS AF系统以及触控屏也加入了到了5D IV上。对焦系统、有效像素以及视频画质都有了非常大的提升。而双像素RAW功能的首次加入，也是新相机的亮点所在，双像素RAW对抑制鬼影，优化镜头成像都有更多的帮助，因此新相机的画质表现还是颇为值得期待的。
佳能5D Mark IV
&nbsp&nbsp&nbsp 佳能EOS 5D Mark IV在对焦方面似乎要更加出色，一方面是继承了EOS-1D X Mark II下放的第二代61点相差检测自动对焦系统，最多41点的十字型自动对焦，61点全部支持F8光圈，再加上7张/秒的连拍速度，在抓拍动态影像上，EOS 5D Mark IV完全是全新的体验。另一方面，全像素双核CMOS AF的加入，即使在实时取景拍摄时也能提供不亚于光学取景器的对焦能力。
佳能5D Mark IV
&nbsp&nbsp&nbsp 佳能EOS 5D Mark IV在功能和易用性上也是有史以来最为完善的单反相机，从4K视频到触屏，再到WiFi都是很完美的，适合人像、野鸟、野生动物、体育等多领域的拍摄提供专业级的捕捉力。
&nbsp&nbsp&nbsp 目前佳能5D Mark IV已经正式到货沈阳，笔者从经销商处获悉，以佳能5D Mark IV为主体的套机佳能5D Mark IV（EF24-70F2.8）售价仅为29999元，需要的朋友千万不要错过了。
[品牌型号]&nbsp佳能5D Mark IV（EF24-70F2.8）&nbsp
[参考价格]&nbsp29999 元&nbsp
[经销商家]&nbsp&nbsp
[咨询电话]&nbsp137-&nbsp
[商家地址]&nbsp辽宁省沈阳市和平区三好街76号（裕宁大酒店一楼停车场）---佳能旗舰店&nbsp
[商家级别]&nbsp&nbsp
上一篇：下一篇：
名&&&&&&称：
参考价格：23999
联&系&人&：卢经理
在线联系：正在检测QQ是否在线...　
联系方式：137-
地&&&&&&址：沈阳 三好街 裕宁大酒店1楼 交通银行旁边号
价格：110元
价格：130元
价格：1230元
价格：60元
最新专题更多>>
关注网上三好街微博
网上三好街-东北地区最具价值IT资讯与商务平台，赶紧关注网上三好街。
沈阳资讯有限公司 版权所有
Copyright & 1999 - , All Rights Reserved.热线电话:024-67223 转 800 广告咨询:024-IT商品推荐群: QQ:
　沈网警备案号
辽网信审批编号
关注三好街动态Bibliography
Agarwal, P. K., and Procopiuc, C. M. (1998),
``Exact and approximation algorithms for clustering'',
Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Agarwal, P. K., and Suri, S. (1994),
``Surface approximation and geometric partitions'',
Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Agarwala, R., Bafna, V., Farach, M., Narayanan, B., Paterson, M., and Thorup,
M. (1996),
``On the approximability of numerical taxonomy'',
Proc. 7th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Aggarwal, A., Coppersmith, D., Khanna, S., Motwani, R., and Schieber, B.
``The angular-metric traveling salesman problem'',
Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Aggarwal, M., and Garg, N. (1994),
``A scaling technique for better network design'',
Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Akutsu, T., and Halldórsson, M. (1994),
``On the approximation of largest common point sets and largest
common subtrees'',
Proc. 5th Ann. Int. Symp. on Algorithms and Computation,
Lecture Notes in Comput. Sci. 834, Springer-Verlag,
Akutsu, T., and Halldórsson, M. (1997),
``On the approximation of largest common point sets and largest
common subtrees'',
Unpublished manuscript.
Alekhnovich, M., Buss, S., Moran, S., and Pitassi, T. (1998),
``Minimum propositional proof length is NP-hard to linearly
approximate'',
Proc. 23rd International Symp. on Mathematical Foundations of
Comput. Sci., Lecture Notes in Comput. Sci. 1450, Springer-Verlag,
Alimonti, P., and Kann, V. (1997),
``Hardness of approximating problems on cubic graphs'',
Proc. 3rd Italian Conf. on Algorithms and Complexity, Lecture
Notes in Comput. Sci. 1203, Springer-Verlag,
Alon, N., Azar, Y., Woeginger, G. J., and Yadid, T. (1997),
``Approximation schemes for scheduling'',
Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Alon, N., Csirik, J., Sevastianov, S. V., Vestjens, A. P. A., and Woeginger,
G. J. (1996),
``On-line and off-line approximation algorithms for vector covering
problems'',
Proc. 4th Ann. European Symp. on Algorithms, Lecture Notes in
Comput. Sci. 1136, Springer-Verlag,
Alon, N., Feige, U., Wigderson, A., and Zuckerman, D. (1995),
``Derandomized graph products'',
Computational Complexity 5,
Alon, N., Yuster, R., and Zwick, U. (1994),
``Color-coding: a new method for finding simple paths, cycles and
other small subgraphs within large graphs'',
Proc. 26th Ann. ACM Symp. on Theory of Comp., ACM,
Alon, Noga, and Kahale, Nabil (1998),
``Approximating the independence number via the
functio n'',
Math. Programming 80,
Althöfer, I., Das, G., Dobkin, D., and Joseph, D. (1990),
``Generating sparse spanners for weighted graphs'',
Proc. 2nd Scandinavian Workshop on Algorithm Theory, , Lecture
Notes in Comput. Sci., Springer-Verlag,
Amaldi, E., and Kann, V. (1995),
``The complexity and approximability of finding maximum feasible
subsystems of linear relations'',
Theoretical Comput. Sci. 147,
Amaldi, E., and Kann, V. (1998),
``On the approximability of minimizing nonzero variables or
unsatisfied relations in linear systems'',
Theoretical Comput. Sci. 209,
Amoura, A. K., Bampis, E., Kenyon, C., and Manoussakis, Y. (1997),
``How to schedule independent multiprocessor tasks'',
Proc. 5th Ann. European Symp. on Algorithms, Lecture Notes in
Comput. Sci. 1284, Springer-Verlag,
Andersson, G. (1999),
``An approximation algorithm for MAX p-SECTION'',
Proc. 16th Ann. Symp. on Theoretical Aspects of Comput. Sci.,
Lecture Notes in Comput. Sci. 1563, Springer-Verlag,
Andersson, G., and Engebretsen, L. (1998a),
``Better approximation algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT'',
Inform. Process. Lett. 65,
Andersson, G., and Engebretsen, L. (1998b),
``Sampling methods applied to non-boolean optimization problems'',
Proc. 2nd Symp. on Randomization and Approximation Techniques in
Comput. Sci., Lecture Notes in Comput. Sci. 1518, Springer-Verlag,
Andersson, G., Engebretsen, L., and Håstad, J. (1999),
``A new way to use semidefinite programming with applications to
linear equations mod p'',
Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms,
Andreae, T., and Bandelt, H. (1995),
``Performance guarantees for approximation algorithms depending on
parametrized triangle inequalities'',
SIAM J. Disc. Math. 8,
Anily, A., Bramel, J., and Simchi-Levi, D. (1994),
``Worst-case analysis of heuristics for the bin-packing problem with
general cost structures'',
Oper. Res. 42,
Anily, S., and Hassin, R. (1992),
``The swapping problem'',
Networks 22,
Arkin, E. M., Chiang, Y., Mitchell, J. S. B., Skiena, S. S., and Yang, T.
``On the maximum scatter TSP'',
Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Arkin, E. M., Halldórsson, M. M., and Hassin, R. (1993),
``Approximating the tree and tour covers of a graph'',
Inform. Process. Lett. 47,
Arkin, E. M., and Hassin, R. (1992),
``Multiple-choice minimum diameter problems'',
Unpublished manuscript.
Arkin, E. M., and Hassin, R. (1994),
``Approximation algorithms for the geometric covering salesman
problem'',
Disc. Appl. Math. 55,
Arkin, E. M., and Hassin, R. (1998),
``On local search for weighted packing probems'',
Math. Oper. Res. 23,
Arkin, E. M., and Hassin, R. (2000),
``Approximating the maximum quadratic assignment problem'',
Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms,
to appear.
Armen, C., and Stein, C. (1994),
``A 2-approximation algorithm for the shortest
superstring problem'',
Technical Report PCS-TR94-214, Department of Computer Science,
Dartmouth College, Hanover, New Hampshire.
Arora, S. (1996),
``Polynomial time approximation scheme for Euclidean TSP and
other geometric problems'',
Proc. 37th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Arora, S. (1997),
``Nearly linear time approximation schemes for Euclidean TSP and
other geometric problems'',
Proc. 38th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Arora, S., Babai, L., Stern, J., and Sweedyk, Z. (1997),
``The hardness of approximate optima in lattices, codes, and systems
of linear equation'',
J. Comput. System Sci. 54,
Arora, S., Frieze, A., and Kaplan, H. (1996),
``A new rounding procedure for the assignment problem with
applications to dense graph arrangement problems'',
Proc. 37th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Arora, S., Grigni, M., Karger, D., Klein, P., and Woloszyn, A. (1998),
``A polynomial-time approximation scheme for Weighted planar graph
Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Arora, S., and Karakostas, G. (1999),
``Approximation schemes for minimum latency problems'',
Proc. 31st Ann. ACM Symp. on Theory of Comp., ACM,
Arora, S., Karger, D., and Karpinski, M. (1995),
``Polynomial time approximation schemes for dense instances of
NP-hard problems'',
Proc. 27th Ann. ACM Symp. on Theory of Comp., ACM,
Arora, Sanjeev, Raghavan, Prabhakar, and Rao, Satish (1998),
``Approximation schemes for Euclidean k-medians and related
problems'',
Proc. 30th Ann. ACM Symp. on Theory of Comp., ACM-SIAM,
Asano, T., Hori, K., Ono, T., and Hirata, T. (1997),
``A theoretical framework of hybrid approaches to MAX SAT'',
Proc. 8th Ann. Int. Symp. on Algorithms and Computation,
Lecture Notes in Comput. Sci. 1350, Springer-Verlag,
Assmann, S. F., Johnson, D. S., Kleitman, D. J., and Leung, J. Y. (1984),
``On a dual version of the one-dimensional bin packing problem'',
J. Algorithms 5,
Aumann, Y., and Rabani, Y. (1995),
``Improved bounds for all optical routing'',
Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Aumann, Y., and Rabani, Y. (1998),
approximate min-cut max-flow theorem and
approximation algorithm'',
SIAM J. Comp. 27,
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti Spaccamela,
A., and Protasi, M. (1999),
Complexity and Approximation. Combinatorial Optimization
Problems and their Approximability Properties,
Springer-Verlag, Berlin.
Ausiello, G., D'Atri, A., and Protasi, M. (1980),
``Structure preserving reductions among convex optimization
problems'',
J. Comput. System Sci. 21,
Ausiello, G., D'Atri, A., and Protasi, M. (1981),
``Lattice theoretic ordering properties for NP-complete
optimization problems'',
Annales Societatis Mathematicae Polonae 4,
Averbakh, I., and Berman, O. (1997),
``(p-1)/(p+1)-approximate algorithms for p-traveling
salesmen problems on a tree with minmax objective'',
Disc. Appl. Math. 75,
Awerbuch, B., and Azar, Y. (1997),
``Buy-at-bulk network design'',
Proc. 38th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Bafna, V., Berman, P., and Fujito, T. (1994),
``Approximating feedback vertex set for undirected graphs within
ratio 2'',
Unpublished manuscript.
Bafna, V., Lawler, E. L., and Pevzner, P. A. (1997),
``Approximation algorithms for multiple sequence alignment'',
Theoretical Comput. Sci. 182,
Bafna, V., and Pevzner, P. A. (1995),
``Sorting permutations by transpositions'',
Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Baker, B. S. (1994),
``Approximation algorithms for NP-complete problems on planar
J. ACM 41,
Bandelt, H., Crama, Y., and Spieksma, F. C. R. (1994),
``Approximation algorithms for multi-dimensional assignment problems
with decomposable costs'',
Disc. Appl. Math. 49,
Bar-Ilan, J., Kortsarz, G., and Peleg, D. (1996),
``Generalized submodular cover problems and applications'',
Proc. 4th Israel Symp. on Theory of Computing and Systems, IEEE
Computer Society,
Bar-Ilan, J., and Peleg, D. (1991),
``Approximation algorithms for selecting network centers'',
Proc. 2nd Workshop on Algorithms and Data Structures, Lecture
Notes in Comput. Sci. 519, Springer-Verlag,
Bar-Noy, A., Bellare, M., Halldórsson, M. M., Shachnai, H., and Tamir, T.
``On chromatic sums and distributed resource allocation'',
Inform. and Comput. 140,
Bar-Noy, A., Halldórsson, M. M., Kortsarz, G., Shachnai, H., and Salman, R.
``Sum multicoloring of graphs'',
Proc. 7th Ann. European Symp. on Algorithms, , Lecture Notes in
Comput. Sci., Springer-Verlag, .
Bar-Noy, A., and Kortsarz, G. (1998),
``The minimum color sum of bipartite graphs'',
J. Algorithms 28,
Bar-Yehuda, R. (1998),
``A linear time 2-approximation algorithm for the min
clique-complement problem'',
Technical Report CS0933, Technion CS Technical Reports.
Bar-Yehuda, R., and Even, S. (1981),
``A linear-time approximation algorithm for the weighted vertex cover
problem'',
J. Algorithms 2,
Bar-Yehuda, R., and Even, S. (1985),
``A local-ratio theorem for approximating the weighted vertex cover
problem'', in
Analysis and Design of Algorithms for Combinatorial Problems,
volume 25 of Annals of Disc. Math., , Annals of Disc. Math.,
Elsevier science publishing company, Amsterdam,
Bar-Yehuda, R., and Moran, S. (1984),
``On approximation problems related to the independent set and vertex
cover problems'',
Disc. Appl. Math. 9,
Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., and Stougie, L.
``Multiprocessor scheduling with rejection'',
Proc. 7th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Barvinok, A. I. (1996),
``Two algorithmic results for the traveling salesman problem'',
Math. Oper. Res. 21,
Bazgan, C., and Fernandez de la Vega, W. (1999),
``A polynomial time approximation scheme for dense Min2SAT'',
Proc. 12th Int. Symp. on Fundamentals of Computation Theory,
Lecture Notes in Comput. Sci. 1684, Springer-Verlag,
Bellare, M. (1993),
``Interactive proofs and approximation: reductions from two provers
in one round'',
Proc. 2nd Israel Symp. on Theory of Computing and Systems, IEEE
Computer Society,
Bellare, M., Goldreich, O., and Sudan, M. (1998),
``Free bits, PCPs and non-approximability - towards tight
results'',
SIAM J. Comp. 27,
Bellare, M., and Rogaway, P. (1995),
``The complexity of approximating a nonlinear program'',
Math. Programming 69,
Bender, M. A., Chakrabarti, S., and Muthukrishnan, S. (1998),
``Flow and stretch metrics for scheduling continuous job streams'',
Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Berger, B., and Cowen, L. (1991),
``Complexity results and algorithms for -constrained
scheduling'',
Proc. Second Ann. ACM-SIAM Symp. on Discrete Algorithms,
Berger, B., and Shor, P. W. (1990),
``Approximation algorithms for the maximum acyclic subgraph
problem'',
Proc. First Ann. ACM-SIAM Symp. on Discrete Algorithms,
Berman, F., Johnson, D., Leighton, T., Shor, P. W., and Snyder, L. (1990),
``Generalized planar matching'',
J. Algorithms 11,
Berman, P., and DasGupta, B. (1997),
``Complexities of efficient solutions of rectilinear polygon cover
problems'',
Algorithmica 17,
Berman, P., and Fujito, T. (1995),
``Approximating independent sets in degree 3 graphs'',
Proc. 4th Workshop on Algorithms and Data Structures, Lecture
Notes in Comput. Sci. 955, Springer-Verlag,
Berman, P., and Karpinski, M. (1998),
``On some tighter inapproximability results'',
Technical Report TR98-065, ECCC.
Berman, P., and Schnitger, G. (1992),
``On the complexity of approximating the independent set problem'',
Inform. and Comput. 96,
Bern, M., and Plassmann, P. (1989),
``The Steiner problem with edge lengths 1 and 2'',
Inform. Process. Lett. 32,
Bernstein, D., Rodeh, M., and Gertner, I. (1989),
``Approximation algorithms for scheduling arithmetic expressions on
pipelined machines'',
J. Algorithms 10,
Bertsimas, D., Teo, C-P., and Vohra, R. (1996),
``On dependent randomized rounding algorithms'',
Proc. 5th Int. Conf. on Integer Prog. and Combinatorial
Optimization, Lecture Notes in Comput. Sci. 1084, Springer-Verlag,
Blache, G., Karpinski, M., and Wirtgen, J. (1998),
``On approximation intractability of the bandwidth problem'',
Technical Report TR98-014, ECCC.
Blaha, K. D. (1992),
``Minimum bases for permutation groups: the greedy approximation'',
J. Algorithms 13,
Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., and
Sudan, M. (1994),
``The minimum latency problem'',
Proc. 26th Ann. ACM Symp. on Theory of Comp., ACM,
Blum, A., Jiang, T., Li, M., Tromp, J., and Yannakakis, M. (1994),
``Linear approximation of shortest superstrings'',
J. ACM 41,
Blum, A., and Karger, D. (1997),
-coloring algorithm for 3-colorable
Inform. Process. Lett. 61,
Blum, A., Ravi, R., and Vempala, S. (1996),
``A constant-factor approximation algorithm for the k-MST
problem'',
Proc. 28th Ann. ACM Symp. on Theory of Comp., ACM,
Böckenhauer, H., Hromkovic, J., Klasing, R., Seibert, S., and Unger, W.
``An improved lower bound on the approximability of metric TSP and
approximation algorithms for the TSP with sharpened triangle inquality'',
Proc. 17th Ann. Symp. on Theoretical Aspects of Comput. Sci.,
Lecture Notes in Comput. Sci. 1770, Springer-Verlag,
Bodlaender, H. L., Gilbert, J. R., Hafsteinsson, H., and Kloks, T. (1995),
``Approximating treewidth, pathwidth, frontsize and shortest
elimination tree'',
J. Algorithms 18,
Bonizzoni, P., Duella, M., and Mauri, G. (1994),
``Approximation complexity of longest common subsequence and shortest
common supersequence over fixed alphabet'',
Technical Report 117/94, Dipartimento di Scienze dell'Informazione,
Università degli Studi di Milano.
Boppana, R., and Halldórsson, M. M. (1992),
``Approximating maximum independent sets by excluding subgraphs'',
Boros, E. (1999),
``Maximum renamable Horn sub-CNFs'',
Disc. Appl. Math. 96-97,
Bshouty, N., and Burroughs, L. (1998),
``Massaging a linear programming solution to give a 2-approximation
for a generalization of the vertex cover problem'',
Proc. 15nth Ann. Symp. on Theoretical Aspects of Comput. Sci.,
, Lecture Notes in Comput. Sci., Springer-Verlag,
Bui, T. N., and Jones, C. (1992),
``Finding good approximate vertex and edge partitions is NP-hard'',
Inform. Process. Lett. 42,
Calinescu, G., Fernandes, C. G., Finkler, U., and Karloff, H. (1996),
``A better approximation algorithm for finding planar subgraphs'',
Proc. 7th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Calinescu, G., Karloff, H., and Rabani, Y. (1998),
``An improved approximation algorithm for multiway cut'',
Proc. 30th Ann. ACM Symp. on Theory of Comp., ACM-SIAM,
Chakrabati, S., Phillips, C. A., Schulz, A. S., Shmoys, D. B., Stein, C., and
Wein, J. (1996),
``Improved scheduling algorithms for minsum criteria'',
Proc. 23rd Int. Colloquium on Automata, Languages and
Programming, Lecture Notes in Comput. Sci. 1099, Springer-Verlag,
Chandra, A. K., Hirschberg, D. S., and Wong, C. K. (1976),
``Approximate algorithms for some generalized knapsack problems'',
Theoretical Comput. Sci. 3,
Chandra, B., and Halldórsson, M. M. (1999),
``Greedy local improvement and weighted set packing approximation'',
Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms,
Charikar, M., Chekuri, C., Cheung, T., Dai, Z., Goel, A., Guha, S., and Li, M.
``Approximation algorithms for directed Steiner problems'',
Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Chaudhary, A., and Vishwanathan, S. (1997),
``Approximation algorithms for the achromatic number'',
Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Chekuri, C., Motwani, R., Natarajan, B., and Stein, C. (1997),
``Approximation techniques for average completion time scheduling'',
Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Chen, B. (1993),
``A better heuristic for preemptive parallel machine scheduling with
batch setup times'',
SIAM J. Comp. 22,
Chen, B. (1994),
``Scheduling multiprocessor flow shops'', in
Advances in Optimization and Approximation, Kluwer Academic
Publishers, The Netherlands,
Chen, B., Glass, C. A., Potts, C. N., and Strusevich, V. A. (1996),
``A new heuristic for three-machine flow shop scheduling'',
Oper. Res. 44,
Chen, B., Potts, C. N., and Strusevich, V. A. (1995),
``Approximation algorithms for two-machine flow shop scheduling with
batch setup times'',
Math. Programming ,
to appear.
Chen, B., and Strusevich, V. A. (1993a),
``Approximation algorithms for three-machine open shop scheduling'',
ORSA J. Comput. 5,
Chen, B., and Strusevich, V. A. (1993b),
``Worst-case analysis of heuristics for open shops with parallel
machines'',
European J. Oper. Res. 70,
Chen, Z.-Z. (1996),
``Practical approximation schemes for maximum induced-subgraph
problems on -free or -free graphs'',
Proc. 23rd Int. Colloquium on Automata, Languages and
Programming, Lecture Notes in Comput. Sci. 1099, Springer-Verlag,
Cheriyan, J., and Thurimella, R. (1996),
``Approximating minimum-size k-connected spanning subgraphs via
matching'',
Proc. 37th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Chlebikova, J. (1996),
``Approximability of the Maximally balanced connected partition
problem in graphs'',
Inform. Process. Lett. 60,
Choi, J., Sellen, J., and Yap, C. K. (1997),
``Approximate Euclidean shortest paths in 3-space'',
International J. Comput. Geom. Appl. 7,
Chor, B., and Sudan, M. (1998),
``A geometric approach to betweenness'',
SIAM J. Disc. Math. 11,
Christie, D. A. (1998),
``A 3/2-approximation algorithm for Sorting by reversals'',
Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Christofides, N. (1976),
``Worst-case analysis of a new heuristic for the travelling salesman
problem'',
Technical Report 388, Graduate School of Industrial Administration,
Carnegie-Mellon University, Pittsburgh.
Chudak, F. A., and Shmoys, D. B. (1997),
``Approximation algorithms for precedence-constrained scheduling
problems on parallel machines that run at different speed'',
Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Chvátal, V. (1979),
``A greedy heuristic for the set covering problem'',
Math. Oper. Res. 4,
Clementi, A., and Ianni, M. Di (1996),
``On the hardness of approximating optimum schedule problems in store
and forward networks'',
IEEE/ACM Transaction on Networking 4,
Clementi, A., and Trevisan, L. (1996),
``Improved non-approximability results for vertex cover problems with
density constraints'',
Proc. 2nd Ann. Int. Conf. on Computing and Combinatorics,
Lecture Notes in Comput. Sci. 1090, Springer-Verlag,
Cody, R. A., and Coffman, E. G., Jr (1976),
``Record allocation for minimizing expected retrieval costs on
drum-like storage devices'',
J. ACM 23,
Coffman, E. G., Jr, Garey, M. R., and Johnson, D. S. (1997),
``Approximation algorithms for bin-packing - a survey'', in
Approximation Algorithms for NP-hard Problems, PWS Publishing
Company, Boston,
Coffman, E. G., Jr, Garey, M. R., Johnson, D. S., and Lapaugh, A. S. (1985),
``Scheduling file transfers'',
SIAM J. Comp. 14,
Cornuejols, G., Fisher, M., and Nemhauser, G. (1977),
``Location of bank accounts to optimize float: An analytic study of
exact and approximate algorithms'',
Management Sci. 23,
Cowen, L. J., Goddard, W., and Jesurum, C. E. (1997),
``Coloring with defect'',
Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Crama, Y., and Spieksma, F. C. R. (1992),
``Approximation algorithms for three-dimensional assignment problems
with triangle inequalities'',
European J. Oper. Res. 60,
Crescenzi, P., Kann, V., Silvestri, R., and Trevisan, L. (1999),
``Structure in approximation classes'',
SIAM J. Comp. 28,
Crescenzi, P., and Panconesi, A. (1991),
``Completeness in approximation classes'',
Inform. and Comput. 93,
Crescenzi, P., Silvestri, R., and Trevisan, L. (1994),
``On the query complexity of complete problems in approximation
classes'',
Unpublished manuscript.
Crescenzi, P., Silvestri, R., and Trevisan, L. (1996),
``To weight or not to weight: Where is the question?'',
Proc. 4th Israel Symp. on Theory of Computing and Systems, IEEE
Computer Society,
Crescenzi, P., and Trevisan, L. (1994),
``On approximation scheme preserving reducibility and its
applications'',
Proc. 14th Ann. Conf. on Foundations of Software Tech. and
Theoret. Comput. Sci., Lecture Notes in Comput. Sci. 880, Springer-Verlag,
Czumaj, A., and Lingas, A. (1999),
``On approximability of the minimum-cost k-connected spanning
subgraph problem'',
Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms,
Dahlhaus, E., Johnson, D. S., Papadimitriou, C. H., Seymour, P. D., and
Yannakakis, M. (1994),
``The complexity of multiterminal cuts'',
SIAM J. Comp. 23,
Damian-Iordache, M., and Pemmaraju, S. V. (1999),
``Hardness of approximating independent domination in circle
Proc. 10th Ann. Int. Symp. on Algorithms and Computation,
Lecture Notes in Comput. Sci. 1741, Springer-Verlag,
d'Anzeo, C. (1996),
``Optimization complexity of the SCS problem given a longest common
subsequence'',
Unpublished manuscript.
DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., and Zhang, L. (1997),
``On distances between phylogenetic trees'',
Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Datta, A. K., and Sen, R. K. (1995),
``1-approximation algorithm for bottleneck disjoint path matching'',
Inform. Process. Lett. 55,
Di Ianni, M. (1998),
``Efficient delay routing'',
Theoretical Comput. Sci. 196,
Doddi, S., Marathe, M. V., Mirzaian, A., Moret, B. M. E., and Zhu, B. (1997),
``Map labeling and its generalizations'',
Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Drangmeister, K. U., Krumke, S. O., Marathe, M. V., Noltemeier, H., and Ravi,
S. S. (1998),
``Modifying edges of a network to obtain short subgraphs'',
Theoretical Comput. Sci. 203,
Dudek, G., Romanik, K., and Whitesides, S. (1994),
``Localizing a robot with minimum travel'',
Technical Report SOCS-94.5, McGill University.
Duh, R., and Fürer, M. (1997),
``Approximation of k-set cover by semi-local optimization'',
Proc. 29th Ann. ACM Symp. on Theory of Comp., ACM,
Eades, P., and Wormald, N. C. (1994),
``Edge crossings in drawings of bipartite graphs'',
Algorithmica 11,
Elkin, M., and Peleg, D. (1999),
``The hardness of approximating spanner problems'',
Technical report, Weizmann Institute.
Engebretsen, L. (1999),
``An explicit lower bound for TSP with distances one and two'',
Proc. 16th Ann. Symp. on Theoretical Aspects of Comput. Sci.,
Lecture Notes in Comput. Sci. 1563, Springer-Verlag,
Eppstein, D. (1992),
``Approximating the minimum weight triangulation'',
Proc. Third Ann. ACM-SIAM Symp. on Discrete Algorithms,
Errico, B., and Rosati, R. (1995),
``Minimal models in propositional logics: approximation results'',
Proc. of 5th Italian Conference on Theoretical Computer
Science, Word Scientific,
Even, G., Naor, J., Rao, S., and Schieber, B. (1995),
``Divide-and-conquer approximation algorithms via spreading
metrics'',
Proc. 36th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Even, G., Naor, J., Rao, S., and Schieber, B. (1997),
``Fast approximate graph partitioning algorithms'',
Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Even, G., Naor, J., Schieber, B., and Sudan, M. (1995),
``Approximating minimum feedback sets and multi-cuts in directed
Proc. 4th Int. Conf. on Integer Prog. and Combinatorial
Optimization, Lecture Notes in Comput. Sci. 920, Springer-Verlag,
Even, G., Naor, J., and Zosin, L. (1996),
``An 8-approximation algorithm for the subset feedback vertex set
problem'',
Proc. 37th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Farach, M., Kannan, S., and Warnow, T. (1993),
``A robust model for finding optimal evolutionary trees'',
Proc. 25th Ann. ACM Symp. on Theory of Comp., ACM,
Farach, M., and Liberatore, V. (1998),
``On local register allocation'',
Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Feder, T., and Greene, D. H. (1988),
``Optimal algorithms for approximate clustering'',
Proc. 20th Ann. ACM Symp. on Theory of Comp., ACM,
Feige, U. (1998),
``A threshold of
for approximating set cover'',
J. ACM 45,
Feige, U., and Goemans, M. X. (1995),
``Approximating the value of two prover proof systems, with
applications to MAX 2SAT and MAX DICUT'',
Proc. 3rd Israel Symp. on Theory of Computing and Systems, IEEE
Computer Society,
Feige, U., Halldórsson, M. M., and Kortsarz, G. (2000),
``Approximating the domatic number'',
Proc. 32nd Ann. ACM Symp. on Theory of Comp., ACM, .
Feige, U., and Kilian, J. (1998),
``Zero knowledge and the chromatic number'',
J. Comput. System Sci. 57,
Feige, U., Kortsarz, G., and Peleg, D. (1995),
``The dense k-subgraph problem'',
Unpublished manuscript.
Fekete, S., Khuller, S., Klemmstein, M., Raghavachari, B., and Young, N.
``A network-flow technique for finding low-weight bounded-degree
spanning trees'',
Proc. 5th Int. Conf. on Integer Prog. and Combinatorial
Optimization, Lecture Notes in Comput. Sci. 1084, Springer-Verlag,
Feo, T., Goldschmidt, O., and Khellaf, M. (1992),
``One half approximation algorithms for the k-partition
problem'',
Oper. Res. 40,
S170-S173.
Feo, T., and Khellaf, M. (1990),
``A class of bounded approximation algorithms for graph
partitioning'',
Networks 20,
Fernandes, C. G. (1997),
``A better approximation ratio for the minimum k-edge-connected
spanning subgraph problem'',
Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Fernandez de la Vega, W., and Karpinski, M. (1998),
``Polynomial time approximation of dense weighted instances of
MAX-CUT'',
Technical Report TR98-064, ECCC, to appear in Randomized Structures
& Algorithms.
Fernandez de la Vega, W., and Karpinski, M. (1999),
``On the approximation hardness of dense TSP and other path
problems'',
Inform. Process. Lett. 70,
Fernandez de la Vega, W., and Kenyon, C. (1998),
``A randomized approximation scheme for metric MAX-CUT'',
Proc. 39th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Fernandez de la Vega, W., and Zissimopoulos, V. (1991),
``An approximation scheme for strip-packing of rectangles with
bounded dimensions'',
Technical Report 713, Laboratoire de Recherche en Informatique,
Université de Paris, Orsay.
Fialko, S., and Mutzel, P. (1998),
``A new approximation algorithm for the Planar augmentation
problem'',
Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Floréen, P., and Orponen, P. (1993),
``Attraction radii in binary Hopfield nets are hard to compute'',
Neural Comput. 5,
Formann, M., and Wagner, F. (1991),
``A packing problem with applications to lettering of maps'',
Proc. 7th Ann. ACM Symp. Comput. Geom., ACM,
Fraser, C. B., and Irving, R. W. (1995),
``Approximation algorithms for the shortest common supersequence'',
Nordic J. Comp. 2,
Fraser, C. B., Irving, R. W., and Middendorf, M. (1996),
``Maximal common subsequences and minimal common supersequences'',
Inform. and Comput. 124,
Frederickson, G. N., Hecht, M. S., and Kim, C. E. (1978),
``Approximation algorithms for some routing problems'',
SIAM J. Comp. 7,
Frederickson, G. N., and Jájá, J. (1981),
``Approximation algorithms for several graph augmentation problems'',
SIAM J. Comp. 10,
Frederickson, G. N., and Jájá, J. (1982),
``On the relationship between the biconnectivity augmentation and
traveling salesman problems'',
Theoretical Comput. Sci. 19,
Frederickson, G. N., and Solis-Oba, R. (1996),
``Increasing the weight of minimum spanning trees'',
Proc. 7th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Frieze, A., Galbiati, G., and Maffioli, F. (1982),
``On the worst-case performance of some algorithms for the asymmetric
traveling salesman problem'',
Networks 12,
Frieze, A., and Jerrum, M. (1997),
``Improved approximation algorithms for MAX k-CUT and MAX
BISECTION'',
Algorithmica 18,
Fujito, T. (1996),
``A unified local ratio approximation of node-deletion problems'',
Proc. 4th Ann. European Symp. on Algorithms, Lecture Notes in
Comput. Sci. 1136, Springer-Verlag,
Fürer, M., and Raghavachari, B. (1994),
``Approximating the minimum-degree Steiner tree to within one of
optimal'',
J. Algorithms 17,
Galbiati, G., Maffioli, F., and Morzenti, A. (1994),
``A short note on the approximability of the maximum leaves spanning
tree problem'',
Inform. Process. Lett. 52,
Galbiati, G., Maffioli, F., and Morzenti, A. (1995),
``On the approximability of some maximum spanning tree problems'',
Proc. 2nd Int. Symp. Latin American Theoretical Informatics,
Lecture Notes in Comput. Sci. 911, Springer-Verlag,
Garey, M. R., and Graham, R. L. (1975),
``Bounds for multiprocessor scheduling with resource constraints'',
SIAM J. Comp. 4,
Garey, M. R., and Johnson, D. S. (1979),
Computers and Intractability: A guide to the theory of
NP-completeness,
W. H. Freeman and Company, San Francisco.
Garg, A., and Tamassia, R. (1994),
``On the computational complexity of upward and rectilinear planarity
testing'',
Proc. DIMACS Int. Workshop on Graph Drawing, Lecture Notes in
Comput. Sci. 894, Springer-Verlag,
Garg, N. (1996),
``A 3-approximation for the minimum tree spanning k vertices'',
Proc. 37th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Garg, N., Konjevod, G., and Ravi, R. (1998),
``A polylogarithmic approximation algorithm for the group Steiner
tree problem'',
Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Garg, N., Santosh, V. S., and Singla, A. (1993),
``Improved approximation algorithms for biconnected subgraphs via
better lower bounding techniques'',
Proc. 4th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Garg, N., Saran, H., and Vazirani, V. (1994),
``Finding separator cuts in planar graphs within twice the optimal'',
Proc. 35th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Garg, N., Vazirani, V. V., and Yannakakis, M. (1994),
``Multiway cuts in directed and node weighted graphs'',
Proc. 21st Int. Colloquium on Automata, Languages and
Programming, Lecture Notes in Comput. Sci. 820, Springer-Verlag,
Garg, N., Vazirani, V. V., and Yannakakis, M. (1996),
``Approximate max-flow min-(multi)cut theorems and their
applications'',
SIAM J. Comp. 25,
Garg, N., Vazirani, V. V., and Yannakakis, M. (1997),
``Primal-dual approximation algorithms for integral flow and multicut
in trees'',
Algorithmica 18,
Gens, G. V., and Levner, E. V. (1979),
``Computational complexity of approximation algorithms for
combinatorial problems'',
Proc. 8th International Symp. on Mathematical Foundations of
Comput. Sci., Lecture Notes in Comput. Sci. 74, Springer-Verlag,
Gergov, J. (1996),
``Approximation algorithms for dynamic storage allocation'',
Proc. 4th Ann. European Symp. on Algorithms, Lecture Notes in
Comput. Sci. 1136, Springer-Verlag,
Gil, J., and Itai, A. (1995),
``Packing trees'',
Proc. 3rd Ann. European Symp. on Algorithms, Lecture Notes in
Comput. Sci. 979, Springer-Verlag,
Goemans, M. X., Goldberg, A. V., Plotkin, S., Shmoys, D. B., Tardos, É., and
Williamson, D. P. (1994),
``Improved approximation algorithms for network design problems'',
Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Goemans, M. X., and Kleinberg, J. M. (1996),
``An improved approximation ratio for the minimum latency problem'',
Proc. 7th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Goemans, M. X., Queyranne, M., Schulz, A. S., Skutella, M., and Wang, Y.
``Single machine scheduling with release dates'',
Unpublished manuscript.
Goemans, M. X., and Williamson, D. P. (1995a),
``A general approximation technique for constrained forest
problems'',
SIAM J. Comp. 24,
Goemans, M. X., and Williamson, D. P. (1995b),
``Improved approximation algorithms for maximum cut and
satisfiability problems using semidefinite programming'',
J. ACM 42,
Goemans, M. X., and Williamson, D. P. (1996),
``Primal-dual approximation algorithms for feedback problems in
planar graphs'',
Proc. 5th Int. Conf. on Integer Prog. and Combinatorial
Optimization, Lecture Notes in Comput. Sci. 1084, Springer-Verlag,
Goldberg, L. A., Paterson, M., Srinivasan, A., and Sweedyk, E. (1997),
``Better approximation guarantees for job-shop scheduling'',
Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Goldschmidt, O., and Hochbaum, D. S. (1988),
``Polynomial algorithm for the k-cut problem'',
Proc. 29th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Gonzalez, T. F. (1985),
``Clustering to minimize the maximum intercluster distance'',
Theoretical Comput. Sci. 38,
Gonzalez, T. F., and Zheng, S. (1989),
``Improved bounds for rectangular and Guilhotine partitions'',
J. Symbolic Comput. 7,
Gonzalez, T. F., and Zheng, S. (1990),
``Approximation algorithm for partitioning a rectangle with interior
Algorithmica 5,
Grigni, M., and Manne, F. (1996),
``On the complexity of the generalized block distribution'',
Proc. of Irregular'96, the third international workshop on
parallel algorithms for irregularly structured problems, , Lecture Notes in
Comput. Sci., Springer-Verlag,
Grigoriadis, M. D., and Khachiyan, L. G. (1994),
``Fast approximation schemes for convex programs with many blocks and
coupling constraints'',
SIAM J. Optimization 4,
Gudmundsson, J., and Levcopoulos, C. (1999),
``Close approximation of minimum rectangular coverings'',
J. Combinatorial Optimization 3,
Guha, S., and Khuller, S. (1996),
``Approximation algorithms for connected dominating sets'',
Proc. 4th Ann. European Symp. on Algorithms, Lecture Notes in
Comput. Sci. 1136, Springer-Verlag,
Guha, S., and Khuller, S. (1998),
``Greedy strikes back: Improved facility location algorithms'',
Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Gusfield, D., and Pitt, L. (1992),
``A bounded approximation for the minimum cost 2-sat problem'',
Algorithmica 8,
Guttmann-Beck, N., and Hassin, R. (1997),
``Approximation algorithms for min-max tree partition'',
J. Algorithms 24,
Guttmann-Beck, N., and Hassin, R. (1998a),
``Approximation algorithms for minimum tree partition'',
Disc. Appl. Math. 87,
Guttmann-Beck, N., and Hassin, R. (1998b),
``Approximation algorithms for minimum sum p-clustering'',
Disc. Appl. Math. 89,
Guttmann-Beck, N., and Hassin, R. (1999),
``Approximation algorithms for minimum k-cut'',
Algorithmica ,
to appear.
Guttmann-Beck, N., Hassin, R., Khuller, S., and Raghavachari, B. (1999),
``Approximation algorithms with bounded performance guarantees for
the clustered traveling salesman problem'',
Algorithmica ,
to appear.
Hall, L. A., Schulz, A. S., Shmoys, D. B., and Wein, J. (1997),
``On-line and off-line approximation algorithms'',
Unpublished manuscript.
Hall, N. G., and Hochbaum, D. S. (1986),
``A fast approximation algorithm for the multicovering problem'',
Disc. Appl. Math. 15,
Halldórsson, M., and Lau, H. C. (1997),
``Low-degree graph partitioning via local search with applications to
constraint satisfaction, max cut, and 3-coloring'',
J. Graph Algorithms and Applications 1,
Halldórsson, M. M. (1993a),
``A still better performance guarantee for approximate graph
coloring'',
Inform. Process. Lett. 45,
Halldórsson, M. M. (1993b),
``Approximating the minimum maximal independence number'',
Inform. Process. Lett. 46,
Halldórsson, M. M. (1994),
``personal communication'',
Unpublished manuscript.
Halldórsson, M. M. (1995a),
``Approximating discrete collections via local improvements'',
Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Halldórsson, M. M. (1995b),
``Approximation via partitioning'',
Technical Report IS-RR-95-0003F, School of Information Science, Japan
Advanced Institute of Science and Technology, Hokuriku.
Halldórsson, M. M. (1999a),
``Approximations of weighted independent set and hereditary subset
problems'',
Proc. 5th Ann. Int. Conf. on Computing and Combinatorics, ,
Lecture Notes in Comput. Sci., Springer-Verlag,
Halldórsson, M. M., Iwano, K., Katoh, N., and Tokuyama, T. (1995),
``Finding subsets maximizing minimum structures'',
Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Halldórsson, M. M., and Kortsarz, G. (1999),
``Multicoloring planar graphs and partial k-trees'',
Proc. 2nd Int. Workshop on Approximation Algorithms for
Combinatorial Problems, , Lecture Notes in Comput. Sci., Springer-Verlag, .
Halldórsson, M. M., Kortsarz, G., and Nutov, Z. (1999),
``Transforming a preemptive coloring into a non-preemptive one with
applications'',
Unpublished manuscript.
Halldórsson, M. M., Kortsarz, G., Proskurowski, A., Salman, R., Shachnai,
H., and Telle, J. A. (1999),
``Multi-coloring trees'',
Proc. 5th Ann. Int. Conf. on Computing and Combinatorics, ,
Lecture Notes in Comput. Sci., Springer-Verlag,
Halldórsson, M. M., Kratochvíl, J., and Telle, J. A. (1998),
``Independent sets with domination constraints'',
Proc. 25th Int. Colloquium on Automata, Languages and
Programming, Lecture Notes in Comput. Sci. 1443, Springer-Verlag,
Halldórsson, M. M., and Tanaka, K. (1996),
``Approximation and special cases of common subtrees and editing
distance'',
Proc. 7th Ann. Int. Symp. on Algorithms and Computation,
Lecture Notes in Comput. Sci. 1178, Springer-Verlag,
Halldórsson, M. M., Ueno, S., Nakao, H., and Kajitani, Y. (1992),
``Approximating Steiner trees in graphs with restricted weights'',
Proc. Asia-Pacific Conference on Circuits and Systems, Sidney,
Australia, ,
Halperin, E. (2000),
``Improved approximation algorithms for the vertex cover problem in
graphs and hypergraphs'',
Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms,
ACM-SIAM, .
Hancock, T., Jiang, T., Li, M., and Tromp, J. (1996),
``Lower bounds on learning decision lists and trees'',
Inform. and Comput. 126,
Haralambides, J., Makedon, F., and Monien, B. (1991),
``Bandwidth minimization: an approximation algorithm for
caterpillars'',
Math. Systems Theory 24,
Hassin, R. (1992),
``Approximation schemes for the restricted shortest path problem'',
Math. Oper. Res. 17,
Hassin, R., and Megiddo, N. (1991),
``Approximation algorithms for hitting objects with straight lines'',
Disc. Appl. Math. 30,
Hassin, R., and Rubinstein, S. (1994),
``Approximations for the maximum acyclic subgraph problem'',
Inform. Process. Lett. 51,
Hassin, R., and Rubinstein, S. (1997),
``An approximation algorithm for maximum packing of 3-edge paths'',
Inform. Process. Lett. 63,
Hassin, R., and Rubinstein, S. (1998a),
``Robust matchings, maximum clustering, and maximum capacitated
medians'',
Proc. 1st Int. Conf. on Fun with Algorithms, , .
Hassin, R., and Rubinstein, S. (1998b),
``Better approximations for Max TSP'',
Unpublished manuscript.
Hassin, R., Rubinstein, S., and Tamir, A. (1997),
``Approximation algorithms for maximum dispersion'',
Oper. Res. Lett. 21,
Håstad, J. (1997),
``Some optimal inapproximability results'',
Proc. 29th Ann. ACM Symp. on Theory of Comp., ACM,
Håstad, J. (1999),
``Clique is hard to approximate within
Acta Mathematica 182,
Håstad, J., Phillips, S., and Safra, S. (1993),
``A well-characterized approximation problem'',
Inform. Process. Lett. 47,
Hein, J., Jiang, T., Wang, L., and Zhang, K. (1996),
``On the complexity of comparing evolutionary trees'',
Disc. Appl. Math. 71,
Hochbaum, D. S. (1982a),
``Approximation algorithms for the set covering and vertex cover
problems'',
SIAM J. Comp. 11,
Hochbaum, D. S. (1982b),
``Heuristics for the fixed cost median problem'',
Math. Programming 22,
Hochbaum, D. S. (1983),
``Efficient bounds for the stable set, vertex cover and set packing
problems'',
Disc. Appl. Math. 6,
Hochbaum, D. S. (1997),
``Approximating covering and packing problems: Set cover, vertex
cover, independent set, and related problems'', in
Approximation algorithms for NP-hard problems, PWS Publishing
Company, Boston,
Hochbaum, D. S. (1997),
``Various notions of approximations: good, better, best, and more'',
Approximation Algorithms for NP-hard Problems, PWS Publishing
Company, Boston,
Hochbaum, D. S., and Maass, W. (1985),
``Approximation schemes for covering and packing problems in image
processing and VLSI'',
J. ACM 32,
Hochbaum, D. S., and Maass, W. (1987),
``Fast approximation algorithms for a nonconvex covering problem'',
J. Algorithms 8,
Hochbaum, D. S., Megiddo, N., Naor, J., and Tamir, A. (1993),
``Tight bounds and 2-approximation algorithms for integer programs
with two variables per inequality'',
Math. Programming 62,
Hochbaum, D. S., and Shmoys, D. B. (1986),
``A unified approach to approximation algorithms for bottleneck
problems'',
J. ACM 33,
Hochbaum, D. S., and Shmoys, D. B. (1987),
``Using dual approximation algorithms for scheduling problems:
theoretical and practical results'',
J. ACM 34,
Hochbaum, D. S., and Shmoys, D. B. (1988),
``A polynomial approximation scheme for machine scheduling on uniform
processors: using the dual approach'',
SIAM J. Comp. 17,
Hofmeister, T., and Lefmann, H. (1998),
``Approximating maximum independent sets in uniform hypergraphs'',
Proc. 23rd International Symp. on Mathematical Foundations of
Comput. Sci., Lecture Notes in Comput. Sci. 1450, Springer-Verlag,
Holyer, I. (1981),
``The NP-completeness of edge-coloring'',
SIAM J. Comp. 10,
Hoogeveen, J. A. (1978),
``Analysis of Christofides' heuristic: Some paths are more
difficult than cycles'',
Oper. Res. Lett. 10,
Hoogeveen, J. A., Lenstra, J. K., and Veltman, B. (1995),
``Three, four, five, six, or the complexity of scheduling with
communication delays'',
Oper. Res. Lett. ,
to appear.
Horowitz, E., and Sahni, S. K. (1976),
``Exact and approximate algorithms for scheduling nonidentical
processors'',
J. ACM 23,
Hsu, W. L., and Nemhauser, G. L. (1979),
``Easy and hard bottleneck location problems'',
Disc. Appl. Math. 1,
Hunt III, H. B., Marathe, M. V., Radhakrishnan, V., Ravi, S. S., Rosenkrantz,
D. J., and Stearns, R. E. (1994),
``Approximation schemes using L-reductions'',
Proc. 14th Ann. Conf. on Foundations of Software Tech. and
Theoret. Comput. Sci., Lecture Notes in Comput. Sci. 880, Springer-Verlag,
Hunt III, H. B., Marathe, M. V., Radhakrishnan, V., Ravi, S. S., Rosenkrantz,
D. J., and Stearns, R. E. (1998),
``Nc-approximation schemes for NP- and PSPACE-hard problems for
geometric graphs'',
J. Algorithms 26,
Hurkens, C. A. J., and Schrijver, A. (1989),
``On the size of systems of sets every t of which have an
SDR, with an application to the worst-case ratio of heuristics for packing
problems'',
SIAM J. Disc. Math. 2,
Ibarra, O. H., and Kim, C. E. (1975),
``Fast approximation for the knapsack and sum of subset problems'',
J. ACM 22,
Ihler, E. (1992),
``The complexity of approximating the class Steiner tree problem'',
Proc. 18th Workshop on Graph-Theoretic Concepts in Computer
Science, Lecture Notes in Comput. Sci. 570, Springer-Verlag,
Jagota, A. (1993),
``Constraint satisfaction and maximum clique'',
Working Notes, AAAI Spring Symposium on AI and NP-hard
Problems, Stanford University,
Jansen, K. (1992),
``An approximation algorithm for the general routing problem'',
Inform. Process. Lett. 41,
Jansen, K. (2000),
``Approximation results for the optimum cost chromatic partition
problem'',
J. Algorithms 34,
Jansen, K., and Öhring, S. (1997),
``Approximation algorithms for time constrained scheduling'',
Inform. and Comput. 132,
Jiang, T., Kearney, P., and Li, M. (1998),
``Orchestrating quartets: approximation and data correction'',
Proc. 39th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Jiang, T., Lawler, E. L., and Wang, L. (1994),
``Aligning sequences via an evolutionary tree: complexity and
approximation'',
Proc. 26th Ann. ACM Symp. on Theory of Comp., ACM,
Jiang, T., and Li, M. (1994a),
``Approximating shortest superstrings with constraints'',
Theoretical Comput. Sci. 134,
Jiang, T., and Li, M. (1994b),
``On the approximation of shortest common supersequences and longest
common subsequences'',
Proc. 21st Int. Colloquium on Automata, Languages and
Programming, Lecture Notes in Comput. Sci. 820, Springer-Verlag,
Johnson, D. S. (1974),
``Approximation algorithms for combinatorial problems'',
J. Comput. System Sci. 9,
Johnson, D. S. (1990),
``A catalog of complexity classes'', in
Algorithms and Complexity,
volume A of Handbook of Theoretical Computer Science, ,
Handbook of Theoretical Computer Science, Elsevier science publishing
company, Amsterdam,
Johnson, D. S., and Garey, M. R. (1985),
``A 71/60 theorem for bin-packing'',
J. Complexity 1,
Jonsson, P. (1997),
``Near-optimal nonapproximability results for some NPO PB-complete
problems'',
Inform. Process. Lett. 68,
Kann, V. (1991),
``Maximum bounded 3-dimensional matching is MAX SNP-complete'',
Inform. Process. Lett. 37,
Kann, V. (1992a),
``On the approximability of the maximum common subgraph problem'',
Proc. 9th Ann. Symp. on Theoretical Aspects of Comput. Sci.,
Lecture Notes in Comput. Sci. 577, Springer-Verlag,
Kann, V. (1992b),
On the Approximability of NP-complete Optimization Problems,
PhD thesis, Department of Numerical Analysis and Computing Science,
Royal Institute of Technology, Stockholm.
Kann, V. (1994a),
``Maximum bounded H-matching is MAX SNP-complete'',
Inform. Process. Lett. 49,
Kann, V. (1994b),
``Polynomially bounded minimization problems that are hard to
approximate'',
Nordic J. Comp. 1,
Kann, V. (1995),
``Strong lower bounds on the approximability of some NPO
PB-complete maximization problems'',
Proc. 20th International Symp. on Mathematical Foundations of
Comput. Sci., Lecture Notes in Comput. Sci. 969, Springer-Verlag,
Kann, V., Khanna, S., Lagergren, J., and Panconesi, A. (1997),
``Hardness of approximating MAX k-CUT and its dual'',
Chicago Journal of Theoretical Computer Science ,
Kann, V., Lagergren, J., and Panconesi, A. (1996),
``Approximability of maximum splitting of k-sets and some other
APX-complete problems'',
Inform. Process. Lett. 58,
Kant, G., and Bodlaender, H. L. (1997),
``Triangulating planar graphs while minimizing the maximum degree'',
Inform. and Comput. 135,
Karger, D., Motwani, R., and Ramkumar, G. D. S. (1997),
``On approximating the longest path in a graph'',
Algorithmica 18,
Karger, D., Motwani, R., and Sudan, M. (1998),
``Approximate graph coloring by semidefinite programming'',
J. ACM 45,
Karloff, H., and Zwick, U. (1997),
``A 7/8-approximation for MAX 3SAT?'',
Proc. 38th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Karmarkar, N., and Karp, R. M. (1982),
``An efficient approximation scheme for the one-dimensional bin
packing problem'',
Proc. 23rd Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Karp, R. M., McKellar, A. C., and Wong, C. K. (1975),
``Near-optimal solutions to a 2-dimensional placement problem'',
SIAM J. Comp. 4,
Karpinski, M. (1997),
``Polynomial time approximation schemes for some dense instances of
NP-hard optimization problems'',
Proc. 1st Symp. on Randomization and Approximation Techniques in
Comput. Sci., Lecture Notes in Comput. Sci. 1269, Springer-Verlag,
Karpinski, M., and Wirtgen, J. (1997),
``On approximation hardness of the bandwidth problem'',
Technical Report TR 97-041, ECCC.
Karpinski, M., Wirtgen, J., and Zelikovsky, A. (1997),
``An approximation algorithm for the bandwidth problem on dense
Technical Report TR97-017, ECCC.
Karpinski, M., and Zelikovsky, A. (1997),
``Approximating dense cases of covering problems'',
Technical Report TR97-004, ECCC.
Karuno, Y., Nagamochi, H., and Ibaraki, T. (1993),
``Vehicle scheduling on a tree with release and handling times'',
Proc. 4th Ann. Int. Symp. on Algorithms and Computation,
Lecture Notes in Comput. Sci. 762, Springer-Verlag,
Kavvadias, D., Papadimitriou, C. H., and Sideri, M. (1993),
``On Horn envelopes and hypergraph transversals'',
Proc. 4th Ann. Int. Symp. on Algorithms and Computation,
Lecture Notes in Comput. Sci. 762, Springer-Verlag,
Kellerer, H., Tautenhahn, T., and Woeginger, G. J. (1996),
``Approximability and nonapproximability results for minimizing total
flow time on a single machine'',
Proc. 28th Ann. ACM Symp. on Theory of Comp., ACM,
Kenyon, C., and Rémila, E. (1996),
``Approximate strip packing'',
Proc. 37th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Khanna, S. (1997),
``A polynomial time approximation scheme for the SONET ring loading
problem'',
Bell Labs Technical J. Spring,
Khanna, S., Linial, N., and Safra, S. (1993),
``On the hardness of approximating the chromatic number'',
Proc. 2nd Israel Symp. on Theory of Computing and Systems, IEEE
Computer Society,
Khanna, S., and Motwani, R. (1996),
``Toward a syntactic characterization of PTAS'',
Proc. 28th Ann. ACM Symp. on Theory of Comp., ACM,
Khanna, S., Motwani, R., Sudan, M., and Vazirani, U. (1999),
``On syntactic versus computational views of approximability'',
SIAM J. Comp. 28,
Khanna, S., Muthukrishnan, S., and Paterson, M. (1998),
``On approximating rectangle tiling and packing'',
Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Khanna, S., Muthukrishnan, S., and Skiena, S. (1997),
``Efficient array partitioning'',
Proc. 24th Int. Colloquium on Automata, Languages and
Programming, Lecture Notes in Comput. Sci. 1256, Springer-Verlag,
Khanna, S., Sudan, M., and Trevisan, L. (1997),
``Constraint satisfaction: the approximability of minimization
problems'',
Proc. 12th Annual IEEE Conference on Computational Complexity,
Khanna, S., Sudan, M., and Williamson, D. P. (1997),
``A complete classification of the approximability of maximization
problems derived from Boolean constraint satisfaction'',
Proc. 29th Ann. ACM Symp. on Theory of Comp., ACM,
Khuller, S. (1997),
``Approximation algorithms for finding highly connected subgraphs'',
Approximation Algorithms for NP-hard Problems, PWS Publishing
Company, Boston,
Khuller, S., Pless, R., and Sussmann, Y. J. (1997),
``Fault tolerant k-center problems'',
Proc. 3rd Italian Conf. on Algorithms and Complexity, Lecture
Notes in Comput. Sci. 1203, Springer-Verlag,
Khuller, S., and Raghavachari, B. (1996),
``Improved approximation algorithms for uniform connectivity
problems'',
J. Algorithms 21,
Khuller, S., Raghavachari, B., and Rosenfeld, A. (1994),
``Localization in graphs'',
Technical Report UMIACS-TR-94-92, University of Maryland, UMIACS.
Khuller, S., Raghavachari, B., and Young, N. (1993),
``Maintaining directed reachability with few edges'',
Technical Report UMIACS-TR-93-87, University of Maryland, UMIACS.
Khuller, S., Raghavachari, B., and Young, N. (1995),
``Approximating the minimum equivalent digraph'',
SIAM J. Comp. 24,
Khuller, S., Raghavachari, B., and Young, N. (1996a),
``Low degree spanning trees of small weight'',
SIAM J. Comp. 25,
Khuller, S., Raghavachari, B., and Young, N. (1996b),
``On strongly connected digraphs with bounded cycle length'',
Disc. Appl. Math. 69,
Khuller, S., and Sussmann, Y. J. (1996),
``The capacitated k-center problem'',
Proc. 4th Ann. European Symp. on Algorithms, Lecture Notes in
Comput. Sci. 1136, Springer-Verlag,
Khuller, S., and Thurimella, R. (1993),
``Approximation algorithms for graph augmentation'',
J. Algorithms 14,
Khuller, S., and Vishkin, U. (1994),
``Biconnectivity approximations and graph carvings'',
J. ACM 41,
Kim, S., and McNaughton, R. (1993),
``Computing the order of a locally testable automaton'',
Unpublished manuscript.
Klein, P., Agrawal, A., Ravi, R., and Rao, S. (1990),
``Approximation through multicommodity flow'',
Proc. 31st Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Klein, P., Plotkin, S. A., and Rao, S. (1993),
``Excluded minors, network decomposition, and multicommodity flow'',
Proc. 25th Ann. ACM Symp. on Theory of Comp., ACM,
Kleinberg, J., and Tardos, É. (1995),
``Approximations for the disjoint paths problem in high-diameter
planar networks'',
Proc. 27th Ann. ACM Symp. on Theory of Comp., ACM,
Kleinberg, J. M. (1996),
``Single-source unsplittable flow'',
Proc. 37th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Kloks, T., Kratsch, D., and Müller, H. (1995),
``Approximating the bandwidth for asteroidal triple-free graphs'',
Proc. 3rd Ann. European Symp. on Algorithms, Lecture Notes in
Comput. Sci. 979, Springer-Verlag,
Ko, M. T., Lee, R. C. T., and Chang, J. S. (1990),
``An optimal approximation algorithm for the rectilinear
m-center problem'',
Algorithmica 5,
Kohli, R., Krishnamurti, R., and Mirchandani, P. (1994),
``The minimum satisfiability problem'',
SIAM J. Disc. Math. 7,
Kolaitis, P. G., and Thakur, M. N. (1994),
``Logical definability of NP optimization problems'',
Inform. and Comput. 115,
Kolaitis, P. G., and Thakur, M. N. (1995),
``Approximation properties of NP minimization classes'',
J. Comput. System Sci. 50,
Kolliopoulos, S. G., and Stein, C. (1997),
``Improved approximation algorithms for unsplittable flow problems'',
Proc. 38th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Kortsarz, G. (1998),
``On the hardness of approximating spanners'',
Proc. 1st Int. Workshop on Approximation Algorithms for
Combinatorial Problems, , Lecture Notes in Comput. Sci., Springer-Verlag,
Kortsarz, G., and Peleg, D. (1994),
``Generating sparse 2-spanners'',
J. Algorithms 17,
Kortsarz, G., and Peleg, D. (1995),
``Approximation algorithms for minimum time broadcast'',
SIAM J. Disc. Math. 8,
Kortsarz, G., and Peleg, D. (1997),
``Approximating shallow-light trees'',
Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Kortsarz, G., and Peleg, D. (1998),
``Generating low-degree 2-spanners'',
SIAM J. Comp. 27,
Kosaraju, S. R., Park, J. K., and Stein, C. (1994),
``Long tours and short superstrings'',
Proc. 35th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Kou, L. T., Stockmeyer, L. J., and Wong, C. K. (1978),
``Covering edges by cliques with regard to keyword conflicts and
intersection graphs'',
Commun. ACM 21,
Koutsoupias, E., Papadimitriou, C. H., and Yannakakis, M. (1996),
``Searching a fixed graph'',
Proc. 23rd Int. Colloquium on Automata, Languages and
Programming, Lecture Notes in Comput. Sci. 1099, Springer-Verlag,
Krivelevich, M., and Sudakov, B. (1998),
``Approximate coloring of uniform hypergraphs'',
Proc. 6th Ann. European Symp. on Algorithms, , Lecture Notes in
Comput. Sci., Springer-Verlag,
Krumke, S. O. (1995),
``On a generalization of the p-center problem'',
Inform. Process. Lett. 56,
Krumke, S. O., Marathe, M. V., Noltemeier, H., Ravi, R., Ravi, S. S., Sundaram,
R., and Wirth, H. C. (1997),
``Improving spanning trees by upgrading nodes'',
Proc. 24th Int. Colloquium on Automata, Languages and
Programming, Lecture Notes in Comput. Sci. 1256, Springer-Verlag,
Kumar, V. (1998),
``Approximating circular arc colouring and bandwidth allocation in
all-optical ring networks'',
Proc. 1st Int. Workshop on Approximation Algorithms for
Combinatorial Problems, , Lecture Notes in Comput. Sci., Springer-Verlag,
Lam, S., and Sethi, R. (1977),
``Worst case analysis of two scheduling algorithms'',
SIAM J. Comp. 6,
Leighton, T., and Rao, S. (1988),
``An approximate max-flow min-cut theorem for uniform multicommodity
flow problems with applications to approximation algorithms'',
Proc. 29th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Lenstra, J. K., and Kan, A. H. G. Rinnooy (1978),
``Complexity of scheduling under precedence constraints'',
Oper. Res. 26,
Lenstra, J. K., and Shmoys, D. B. (1995),
``Computing near-optimal schedules'', in
Scheduling Theory and its Applications, Wiley, Chichester,
Lenstra, J. K., Shmoys, D. B., and Tardos, É. (1990),
``Approximation algorithms for scheduling unrelated parallel
machines'',
Math. Programming 46,
Leonardi, S., and Raz, D. (1997),
``Approximating total flow time on parallel machines'',
Proc. 29th Ann. ACM Symp. on Theory of Comp., ACM,
Leung, J. Y.-T., and Wei, W.-D. (1995),
``Tighter bounds on a heuristic for a partition problem'',
Inform. Process. Lett. 56,
Levcopoulos, C. (1985),
``A fast heuristic for covering polygons by rectangles'',
Proc. Fundamentals of Computation Theory, Lecture Notes in
Comput. Sci. 199, Springer-Verlag, .
Levcopoulos, C., and Gudmundsson, J. (1997),
``Approximation algorithms for covering polygons with squares and
similar problems'',
Proc. 1st Symp. on Randomization and Approximation Techniques in
Comput. Sci., Lecture Notes in Comput. Sci. 1269, Springer-Verlag,
Levcopoulos, C., and Krznaric, D. (1998),
``Quasi-greedy triangulations approximating the minimum weight
triangulation'',
J. Algorithms 27,
Li, C., McCormick, S. T., and Simchi-Levi, D. (1990),
``The complexity of finding two disjoint paths with min-max objective
function'',
Disc. Appl. Math. 26,
Li, C., McCormick, S. T., and Simchi-Levi, D. (1992),
``On the minimum-cardinality-bounded-diameter and the
bounded-cardinality-minimum-diameter edge addition problems'',
Oper. Res. Lett. 11,
Li, K., and Cheng, K. (1990),
``On three-dimensional packing'',
SIAM J. Comp. 19,
Li, M. (1990),
``Towards a DNA sequencing theory'',
Proc. 31st Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Li, M., Ma, B., and Wang, L. (1999),
``Finding similar regions in many strings'',
Proc. 31st Ann. ACM Symp. on Theory of Comp., ACM-SIAM,
Lin, C. (1994),
``Hardness of approximating graph transformation problem'',
Proc. 5th Ann. Int. Symp. on Algorithms and Computation,
Lecture Notes in Comput. Sci. 834, Springer-Verlag,
Lin, J-H., and Vitter, J. S. (1992),
``-approximations with minimum packing constraint
violation'',
Proc. 24th Ann. ACM Symp. on Theory of Comp., ACM,
Lipton, R. J., and Tarjan, R. E. (1979),
``A separator theorem for planar graphs'',
SIAM J. Appl. Math. 36,
Lu, H., and Ravi, R. (1992),
``The power of local optimization: Approximation algorithms for
maximum-leaf spanning tree'',
Proc. 30th Ann. Allerton Conf. on Communication, Control and
Computing, ,
Ludwig, W., and Tiwari, P. (1994),
``Scheduling malleable and nonmalleable parallel tasks'',
Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM,
Lund, C., and Yannakakis, M. (1993),
``The approximation of maximum subgraph problems'',
Proc. 20th Int. Colloquium on Automata, Languages and
Programming, Lecture Notes in Comput. Sci. 700, Springer-Verlag,
Lund, C., and Yannakakis, M. (1994),
``On the hardness of approximating minimization problems'',
J. ACM 41,
Ma, B., and Wang, L. (1999),
``On the inapproximability of disjoint paths and minimum Steiner
forest with bandwidth constraints'',
J. Comput. System Sci. ,
to appear.
Mahajan, S., and Ramesh, J. (1995),
``Derandomizing semidefinite programming based approximation
algorithms'',
Proc. 36th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Makedon, F., and Tragoudas, S. (1990),
``Approximating the minimum net expansion: near optimal solutions to
circuit partitioning problems'',
Proc. 16th Workshop on Graph-Theoretic Concepts in Computer
Science, Lecture Notes in Comput. Sci. 484, Springer-Verlag,
Malesinska, E., and Panconesi, A. (1996),
``On the hardness of frequency allocation for hybrid networks'',
Proc. 22nd Workshop on Graph-Theoretic Concepts in Computer
Science, Lecture Notes in Comput. Sci. 1197, Springer-Verlag,
Marathe, M. V., Breu, H., Hunt III, H. B., Ravi, S. S., and Rosenkrantz,
D. J. (1995),
``Simple heuristics for unit disk graphs'',
Networks 25,
Marathe, M. V., Hunt III, H. B., and Ravi, S. S. (1996),
``Efficient approximation algorithms for domatic partition and
on-line coloring of circular arc graphs'',
Disc. Appl. Math. 64,
Marathe, M. V., Ravi, R., Sundaram, R., Ravi, S. S., Rosenkrantz, D. J., and
Hunt III, H. B. (1995),
``Bicriteria network design problems'',
Proc. 22nd Int. Colloquium on Automata, Languages and
Programming, Lecture Notes in Comput. Sci. 944, Springer-Verlag,
Maruyama, O., and Miyano, S. (1995),
``Graph inference from a walk for trees of bounded degree 3 is
NP-complete'',
Proc. 20th International Symp. on Mathematical Foundations of
Comput. Sci., Lecture Notes in Comput. Sci. 969, Springer-Verlag,
Mata, C. S., and Mitchell, J. S. B. (1995),
``Approximation algorithms for geometric tour and network design
problems'',
Proc. 11th Ann. ACM Symp. Comput. Geom., ACM,
Michel, C., Schroeter, H., and Srivastav, A. (1995),
``TSP and matching in printed circuit board assembly'',
European Symposium on Operations Research, , .
Middendorf, M. (1994),
``On the approximation of finding various minimal, maximal, and
consistent sequences'',
Proc. 5th Ann. Int. Symp. on Algorithms and Computation,
Lecture Notes in Comput. Sci. 834, Springer-Verlag,
Mitchell, J. S. B., Piatko, C., and Arkin, E. M. (1992),
``Computing a shortest k-link path in a polygon'',
Proc. 33rd Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE
Computer Society,
Mitchell, J. S. B., and Suri, S. (1992),
``Separation and approximation of polyhedral objects'',
Proc. Third Ann. ACM-SIAM Symp. on Discrete Algorithms,
Möhring, R. H., Schäffter, M. W., and Schulz, A. S. (1996),
``Scheduling jobs with communication delays: using infeasible
solution}