Titlebook: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques; 7th International Wo Klaus Jansen,Sanjeev Khanna,Da

只看該作者 · 發(fā)表于 2025-3-30 12:42:38

A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and OneWe present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one..As applications, we get a 5/4-approximation algorithm for the (minimum) asymmetric TSP with weights one and two and a 3/4-approximation algorithm for the Maximum Directed Path Packing Problem.

只看該作者 · 發(fā)表于 2025-3-30 17:27:23

只看該作者 · 發(fā)表于 2025-3-30 21:18:46

Simultaneous Source Locationbe satisfied. We give an exact algorithm for trees and show how this can be combined with a result of R?cke to give a solution that exceeds edge capacities by at most .(log.. log log.), where . is the number of nodes. On graphs of bounded treewidth, we show the problem is still NP-Hard, but we are a

只看該作者 · 發(fā)表于 2025-3-31 02:20:05

只看該作者 · 發(fā)表于 2025-3-31 05:10:08

只看該作者 · 發(fā)表于 2025-3-31 11:18:44

只看該作者 · 發(fā)表于 2025-3-31 16:33:45

只看該作者 · 發(fā)表于 2025-3-31 19:21:53

只看該作者 · 發(fā)表于 2025-3-31 23:20:57

		自動登錄	找回密碼
密碼			To register

關于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點評	投稿經(jīng)驗總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學	Yale Uni.	Stanford Uni.
\|Archiver\|手機版\|小黑屋\| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-18 19:16
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權所有 All rights reserved