Filters








50,322 Hits in 5.9 sec

Stochastic spanning tree problem

Hiroaki Ishii, Shōgo Shiode, Toshio Nishida, Yoshikazu Namasuya
<span title="">1981</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lx7dev2le5anbg6oarljwh7lie" style="color: black;">Discrete Applied Mathematics</a> </i> &nbsp;
spanning tree satisfying a certain chance constraint.  ...  The minimal spanning tree problem has been well studied and until now many efficient algorithms such as [5, 6] have been proposed.  ...  Acknowledgement The authors wish to thank Associate Professor Yoshio Tabata of Osaka University for his invaluable suggestions and encouragement. The authors also would like to thank Mr.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0166-218x(81)90004-4">doi:10.1016/0166-218x(81)90004-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nhssqznyn5gadlm6tn7ifvnjhm">fatcat:nhssqznyn5gadlm6tn7ifvnjhm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170928232503/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/6f1/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMTY2MjE4eDgxOTAwMDQ0.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9f/87/9f8762c6a0145af3fa3e5be5261e9e9e0e3ab7a5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0166-218x(81)90004-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Optimal Tree Topology for a Submarine Cable Network With Constrained Internodal Latency [article]

Tianjiao Wang, Zengfu Wang, Bill Moran, Moshe Zukerman
<span title="2020-07-28">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Our solution method is based on total cost minimization, where the individual cable costs are assumed to be linear to the length of the corresponding submarine cables subject to latency constraints between  ...  Our method combines the Fast Marching Method (FMM) and a new Integer Linear Programming (ILP) formulation for Minimum Spanning Tree (MST) where there are constraints between pairs of nodes.  ...  edge (i, j) is in the spanning tree and node a is on the side of node j, y b ji = 1 means that edge (i, j) is in the spanning tree and node b is on the side of i.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.14380v1">arXiv:2007.14380v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ypuv26esujbdvf3gx7dzmcb3p4">fatcat:ypuv26esujbdvf3gx7dzmcb3p4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200827175856/https://arxiv.org/pdf/2007.14380v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/77/72/7772dd39028a7a229dc19022077b7a6e713f88ad.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.14380v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Maximizing the Weighted Number of Spanning Trees: Near-t-Optimal Graphs [article]

Kasra Khosoussi, Gaurav S. Sukhatme, Shoudong Huang, Gamini Dissanayake
<span title="2016-04-12">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This paper tackles the open problem of designing graphs with the maximum weighted number of spanning trees under various constraints.  ...  The weighted number of spanning trees, as a connectivity measure, emerges in numerous problems and plays a key role in, e.g., network reliability under random edge failure, estimation over networks and  ...  Relaxing these constraints into 0 ≤ π i ≤ 1 yields the following convex optimization problem, minimize π c i=1 π i subject to log det L(π) ≥ δ + τ init , 0 ≤ π i ≤ 1, ∀i ∈ [c].  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1604.01116v2">arXiv:1604.01116v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/winn2pzyvbhf5gvt43tj6w3ryy">fatcat:winn2pzyvbhf5gvt43tj6w3ryy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191024104450/https://arxiv.org/pdf/1604.01116v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f7/a7/f7a7bcca237c710a9cff7c3d6ad7c5906bd4f945.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1604.01116v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems [article]

Andre Linhares, Chaitanya Swamy
<span title="2016-05-10">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We study the min-cost chain-constrained spanning-tree (abbreviated ) problem: find a min-cost spanning tree in a graph subject to degree constraints on a nested family of node sets.  ...  We show that this Lagrangian-relaxation based idea is in fact applicable more generally and, for any cost-minimization problem with packing side-constraints, yields a reduction from the weighted to the  ...  We extend the above idea to an arbitrary cost-minimization problem with packing side-constraints as follows.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1605.03203v1">arXiv:1605.03203v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rv3sobbfoba5xocsbooh7ddbrq">fatcat:rv3sobbfoba5xocsbooh7ddbrq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200923133337/https://arxiv.org/pdf/1605.03203v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e8/70/e870cd650dc65bbd622d24acde3ada867b6b1b75.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1605.03203v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Page 2945 of Mathematical Reviews Vol. , Issue 89E [page]

<span title="">1989</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
(S-LINK) Designing a minimal spanning tree network subject to a budget constraint. Optimization 19 (1988), no. 4, 475-484.  ...  Summary: “The problem of determining a minimal spanning tree, subject to side constraints, arises frequently in the design of com- puter communication networks and pipeline systems.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1989-05_89e/page/2945" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1989-05_89e/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Interface Placement in Constructing Widest Spanning Tree for Multi-Channel Multi-Interface Wireless Mesh Networks

Hon Sun Chiu, Kwan L. Yeung, King-Shan Lui
<span title="">2009</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xu3nssyjojgz5moccrokj4jz7q" style="color: black;">2009 IEEE Wireless Communications and Networking Conference</a> </i> &nbsp;
Numerical results show that interface placement provides a significant boost to the bandwidth of the widest spanning tree found.  ...  Widest spanning tree is a broadcast tree with its bottleneck link bandwidth maximized. It provides a cost effective broadcasting solution in multi-channel multi-interface wireless mesh networks.  ...  For this reason, a widest spanning tree is proposed to minimize the content update time [14] , where the width of a tree is defined as its bottleneck link bandwidth.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/wcnc.2009.4917760">doi:10.1109/wcnc.2009.4917760</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/wcnc/ChiuYL09.html">dblp:conf/wcnc/ChiuYL09</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2kkojndtj5frpg3s3acr2ho6cu">fatcat:2kkojndtj5frpg3s3acr2ho6cu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171129234417/https://core.ac.uk/download/pdf/37897009.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c0/e9/c0e93639d9545b34976504b04f572e6b383ac4e4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/wcnc.2009.4917760"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Minimal spanning trees with a constraint on the number of leaves

Lucinda Matos Fernandes, Luis Gouveia
<span title="">1998</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2fqqu5s6wbgk5gcucpt3wqm3gy" style="color: black;">European Journal of Operational Research</a> </i> &nbsp;
In this paper we discuss minimal spanning trees with a constraint on the number of leaves. Tree topologies appear when designing centralized terminal networks.  ...  Assuming that the hardware and software for message routing in the nodes is already available, the above discussion motivates a constraint stating that a tree solution has to contain exactly a certain  ...  Maffioli for bringing the MaxLeaves problem to our attention. Thanks are also to two referees whose suggestions have also helped to improve the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0377-2217(96)00327-x">doi:10.1016/s0377-2217(96)00327-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4om6wfvsg5hf3jz42ti5q5je7a">fatcat:4om6wfvsg5hf3jz42ti5q5je7a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190227234826/http://pdfs.semanticscholar.org/9851/242c5b1080d128272c791475112c712bab77.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/98/51/9851242c5b1080d128272c791475112c712bab77.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0377-2217(96)00327-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

CHANCE CONSTRAINED SPANNING TREE PROBLEM
確率条件スパニング・ツリー問題

Hiroaki Ishii, Shogo Shiode, Toshio Nishida
<span title="">1981</span> <i title="The Operations Research Society of Japan"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vx5eaolsanawhn5k4ezvk4kbga" style="color: black;">Journal of the Operations Research Society of Japan</a> </i> &nbsp;
Absnact We consider a stochastic version of minimal spanning tree problem in which edge cests are random variabies, The problern is to find an opl.irnal spanning tree and optimal probability level ofa  ...  certain chance constraint.  ...  L X : a minimal spanning tree for the case of each edge cost v.; ] XU: a maximal sPanning tr'ee for the case of eaeh edge cest a?. j qL4q(xL). qU4q(xU).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.15807/jorsj.24.147">doi:10.15807/jorsj.24.147</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tquawuzh6jca3bhkztbup523vi">fatcat:tquawuzh6jca3bhkztbup523vi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181101143518/https://www.jstage.jst.go.jp/article/jorsj/24/2/24_KJ00001202295/_pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/12/96/12967645937ef9c67b7f2da7df6a5f8e25cca9c1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.15807/jorsj.24.147"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Network flow models for designing diameter-constrained minimum-spanning and Steiner trees

Luis Gouveia, Thomas L. Magnanti
<span title="">2003</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p4qgtym3grdnngfxilwqjjxqy4" style="color: black;">Networks</a> </i> &nbsp;
The Diameter-Constrained Minimum Spanning Tree Problem seeks a least cost spanning tree subject to a (diameter) bound imposed on the number of edges in the tree between any node pair.  ...  We formulate the problem as a directed tree from a selected central node or a selected central edge.  ...  Acknowledgments We are grateful to the referees for their suggestions leading to a substantially improved presentation of the results of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/net.10069">doi:10.1002/net.10069</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ro337gr6w5a5fokyzfi7sjdo6y">fatcat:ro337gr6w5a5fokyzfi7sjdo6y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070702151731/http://dspace.mit.edu/bitstream/1721.1/5310/1/OR-359-01.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f8/3e/f83e5179a4a5ded4cbd57012091d47f644ecfe22.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/net.10069"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

Virtual Private Network to Spanning Tree Mapping [chapter]

Yannick Brehon, Daniel Kofman, Augusto Casaca
<span title="">2007</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
One of its goals is to provide clients with VPN services, and in this context, loadbalancing and protection have become important issues.  ...  Further research on the subject is targeting the resiliency of the generated forests, to minimize the impact of a single failure.  ...  Conclusion In this paper we tackled the problem of mapping VPNs to Spanning Trees in Metro Ethernet networks. We formulated this problem as a novel MINLP problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-72606-7_60">doi:10.1007/978-3-540-72606-7_60</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/j26hbyqknrclrgd63swofmjnmy">fatcat:j26hbyqknrclrgd63swofmjnmy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150921184305/http://dl.ifip.org/db/conf/networking/networking2007/BrehonKC07.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/44/59/44591ae80b01821ab1648f38c88bccc308719c32.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-72606-7_60"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Link set sizing for networks supporting SMDS

F.Y.S. Lin
<span title="">1993</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wn5qtqh7ejhpfdjtrxhija73bq" style="color: black;">IEEE/ACM Transactions on Networking</a> </i> &nbsp;
Absfruct-To size networks that support Switched Multimegabit Data Service (SMDS), we must determine how much additional capacity is needed and where it is needed so as to minimize the total capacity augmentation  ...  A solution procedure based upon Lagrangean relaxation is proposed for one of the formulations.  ...  hand side of Constraint (4) (together with ( 5 ) and (6) ) equals N -1 if link 1 is used in the spanning tree for root o to multicast messages and 0 otherwise.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/90.266060">doi:10.1109/90.266060</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/exgye2aosvalbnt2nqbdnrixhy">fatcat:exgye2aosvalbnt2nqbdnrixhy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830031400/http://oplab.im.ntu.edu.tw/download/pubication/Paper/Paper-always/Link%20Set%20Sizing%20for%20Networks%20Supporting%20SMDS.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d5/eb/d5eb42a4c3a449da6d1e00a6373a7f3e61cef650.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/90.266060"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Link Set Sizing for Networks Supporting SMDS [chapter]

Frank Y. S. Lin
<span title="">1994</span> <i title="Springer US"> Network Management and Control </i> &nbsp;
Absfruct-To size networks that support Switched Multimegabit Data Service (SMDS), we must determine how much additional capacity is needed and where it is needed so as to minimize the total capacity augmentation  ...  A solution procedure based upon Lagrangean relaxation is proposed for one of the formulations.  ...  hand side of Constraint (4) (together with ( 5 ) and (6) ) equals N -1 if link 1 is used in the spanning tree for root o to multicast messages and 0 otherwise.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4899-1298-5_41">doi:10.1007/978-1-4899-1298-5_41</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/t44igxr4nnhibkmmqz2olxxteu">fatcat:t44igxr4nnhibkmmqz2olxxteu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830031400/http://oplab.im.ntu.edu.tw/download/pubication/Paper/Paper-always/Link%20Set%20Sizing%20for%20Networks%20Supporting%20SMDS.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d5/eb/d5eb42a4c3a449da6d1e00a6373a7f3e61cef650.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4899-1298-5_41"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Chain-Constrained Spanning Trees [chapter]

Neil Olver, Rico Zenklusen
<span title="">2013</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Our approach reduces the problem to a family of independent matroid intersection problems, leading to a spanning tree that violates each constraint by a factor of at most 9.  ...  Since the problem is hard, the goal is typically to find a spanning tree that violates the constraints as little as possible.  ...  the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-36694-9_28">doi:10.1007/978-3-642-36694-9_28</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jgexx7calvfz5ayq7fpwsb6ycm">fatcat:jgexx7calvfz5ayq7fpwsb6ycm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180726172715/https://link.springer.com/content/pdf/10.1007%2Fs10107-017-1126-7.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/63/10/6310d24a03678bccdb0b935717ad99961bef6b5e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-36694-9_28"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Chain-constrained spanning trees

Neil Olver, Rico Zenklusen
<span title="2017-02-27">2017</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/o653fqsowvcyrhw6p4gdmpdkwm" style="color: black;">Mathematical programming</a> </i> &nbsp;
Our approach reduces the problem to a family of independent matroid intersection problems, leading to a spanning tree that violates each constraint by a factor of at most 9.  ...  Since the problem is hard, the goal is typically to find a spanning tree that violates the constraints as little as possible.  ...  the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10107-017-1126-7">doi:10.1007/s10107-017-1126-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5zskvd5kn5ernm5bgum4bcekda">fatcat:5zskvd5kn5ernm5bgum4bcekda</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180726172715/https://link.springer.com/content/pdf/10.1007%2Fs10107-017-1126-7.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/63/10/6310d24a03678bccdb0b935717ad99961bef6b5e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10107-017-1126-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

String-to-Tree Multi Bottom-up Tree Transducers

Nina Seemann, Fabienne Braune, Andreas Maletti
<span title="">2015</span> <i title="Association for Computational Linguistics"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5n6volmnonf5tn6xputi5f2t3e" style="color: black;">Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers)</a> </i> &nbsp;
Our new parameterized rule extraction algorithm extracts string-to-tree rules that can be discontiguous and non-minimal in contrast to existing algorithms for the tree-to-tree setting.  ...  We achieve significant improvements in several syntax-based machine translation experiments using a string-to-tree variant of multi bottom-up tree transducers.  ...  Acknowledgement The authors would like to express their gratitude to the reviewers for their helpful comments and Robin Kurtz for preparing the Arabic corpus.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3115/v1/p15-1079">doi:10.3115/v1/p15-1079</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/acl/SeemannBM15.html">dblp:conf/acl/SeemannBM15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xqyigo7lhbbfnluch4etwp3n24">fatcat:xqyigo7lhbbfnluch4etwp3n24</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180601200417/http://aclweb.org/anthology/P15-1079" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d3/10/d31037523fb576d8d8c77fe537a93b61482da0ca.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3115/v1/p15-1079"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 50,322 results