Pages that link to "Item:Q4216149"

The following pages link to Bicriteria Network Design Problems (Q4216149):

Displaying 50 items.

• When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
• On some network design problems with degree constraints (Q355516) (← links)
• The density maximization problem in graphs (Q386420) (← links)
• New approaches to multi-objective optimization (Q403670) (← links)
• Polynomial time approximation schemes for the constrained minimum spanning tree problem (Q442910) (← links)
• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem (Q486390) (← links)
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
• Approximating some network design problems with node costs (Q638508) (← links)
• Strongly polynomial-time approximation for a class of bicriteria problems. (Q703276) (← links)
• Real time scheduling with a budget: parametric-search is better than binary search (Q845717) (← links)
• Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (Q849632) (← links)
• Optimizing cost flows by edge cost and capacity upgrade (Q876725) (← links)
• Budget constrained minimum cost connected medians (Q876728) (← links)
• Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
• A new model for path planning with interval data (Q1000974) (← links)
• Data aggregation in sensor networks: Balancing communication and delay costs (Q1008733) (← links)
• Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
• A polynomial solvable minimum risk spanning tree problem with interval data (Q1027578) (← links)
• Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
• Approximating the weight of shallow Steiner trees (Q1296580) (← links)
• Compact location problems (Q1391322) (← links)
• A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. (Q1426727) (← links)
• Approximation algorithms for multi-parameter graph optimization problems (Q1602708) (← links)
• The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
• Exact algorithms for bi-objective ring tree problems with reliability measures (Q1652601) (← links)
• The non-approximability of bicriteria network design problems (Q1827279) (← links)
• Approximation algorithms for time-dependent orienteering. (Q1853044) (← links)
• Minimum diameter vertex-weighted Steiner tree (Q2039644) (← links)
• Exact algorithms for finding constrained minimum spanning trees (Q2082219) (← links)
• Finding bounded diameter minimum spanning tree in general graphs (Q2147109) (← links)
• Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
• Approximate tradeoffs on weighted labeled matroids (Q2341761) (← links)
• Reducing the diameter of a unit disk graph via node addition (Q2353655) (← links)
• A general approximation method for bicriteria minimization problems (Q2402670) (← links)
• Competitive algorithms for the bicriteria \(k\)-server problem (Q2433801) (← links)
• Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)
• Approximating \(k\)-hop minimum-spanning trees (Q2488210) (← links)
• Bounded-hops power assignment in ad hoc wireless networks (Q2492211) (← links)
• The constrained minimum weighted sum of job completion times problem (Q2494511) (← links)
• Meet and merge: approximation algorithms for confluent flows (Q2495396) (← links)
• A class of node based bottleneck improvement problems (Q2503225) (← links)
• Approximation algorithms for priority Steiner tree problems (Q2695278) (← links)
• Approximability results for the converse connected<i>p</i>-centre problem^† (Q2958261) (← links)
• Network-Design with Degree Constraints (Q3088102) (← links)
• Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (Q3503853) (← links)
• Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem (Q3512450) (← links)
• Improving spanning trees by upgrading nodes (Q4571960) (← links)
• Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
• (Q4645203) (redirect page) (← links)
• Service-constrained network design problems (Q5054805) (← links)