Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
6
search results - page 2 / 2
»
Evasiveness of Subgraph Containment and Related Properties
Sort
relevance
views
votes
recent
update
View
thumb
title
160
click to vote
COCOA
2008
Springer
167
views
Discrete Geometry
»
more
COCOA 2008
»
Strong Formulations for 2-Node-Connected Steiner Network Problems
15 years 7 months ago
Download
ls11-www.cs.uni-dortmund.de
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »