找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Algorithms -- ESA 2010, Part II; 18th Annual European Mark Berg,Ulrich Meyer Conference proceedings 2010 Springer-Verlag Berlin Heidelberg

[復(fù)制鏈接]
樓主: Pierce
11#
發(fā)表于 2025-3-23 13:46:48 | 只看該作者
12#
發(fā)表于 2025-3-23 16:11:12 | 只看該作者
https://doi.org/10.1007/978-3-7091-4012-3n self-intersecting polygons with an unfolding in 4d. In contrast to this old result, our NP-hardness reductions are substantially simpler..As a positive result we show that the Fréchet distance between polygons with one hole can be computed in polynomial time.
13#
發(fā)表于 2025-3-23 21:03:49 | 只看該作者
Der historische Roman und seine Formen,the running-time is .(.log.?+?(.?+?|.|).)..This is an extension of an algorithm by Erickson and Whittlesey [., 1038–1046 (2005)], which computes a shortest cut graph with a single given vertex. Moreover, our proof is simpler and also reveals that the algorithm actually computes a minimum-weight basis of some matroid.
14#
發(fā)表于 2025-3-23 23:31:13 | 只看該作者
15#
發(fā)表于 2025-3-24 05:29:21 | 只看該作者
16#
發(fā)表于 2025-3-24 10:03:03 | 只看該作者
17#
發(fā)表于 2025-3-24 12:01:00 | 只看該作者
Shortest Cut Graph of a Surface with Prescribed Vertex Setthe running-time is .(.log.?+?(.?+?|.|).)..This is an extension of an algorithm by Erickson and Whittlesey [., 1038–1046 (2005)], which computes a shortest cut graph with a single given vertex. Moreover, our proof is simpler and also reveals that the algorithm actually computes a minimum-weight basis of some matroid.
18#
發(fā)表于 2025-3-24 17:10:48 | 只看該作者
A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Tieswhen preference lists of one side do not contain ties, and it cannot be approximated within . unless P=NP. However, even under this restriction, the best known approximation ratio is still 1.5. In this paper, we improve it to ..
19#
發(fā)表于 2025-3-24 22:56:22 | 只看該作者
Pairing Heaps with Costless Meldre . is the size of the priority queue at the time the operation is performed. These bounds are the best known for any self-adjusting heap, and match the lower bound established by Fredman for a family of such priority queues. Moreover, our structure is even simpler than that in [1].
20#
發(fā)表于 2025-3-25 02:36:31 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-24 04:20
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
河津市| 诸城市| 合阳县| 沂水县| 土默特右旗| 庆阳市| 苏尼特左旗| 永川市| 涿州市| 东明县| 洮南市| 黄龙县| 韩城市| 渝北区| 呼伦贝尔市| 固阳县| 上杭县| 南召县| 西安市| 宜宾市| 甘谷县| 禄丰县| 新津县| 马鞍山市| 孙吴县| 博野县| 宜君县| 嘉荫县| 视频| 井研县| 阳城县| 保亭| 彭州市| 滨海县| 长白| 醴陵市| 伊金霍洛旗| 墨江| 惠来县| 曲麻莱县| 龙川县|