Matroid and knapsack center problems (Q300451): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
aliases / en / 0aliases / en / 0
 
Matroid and Knapsack Center Problems
description / endescription / en
 
scientific article; zbMATH DE number 6146540
Property / title
 
Matroid and Knapsack Center Problems (English)
Property / title: Matroid and Knapsack Center Problems (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1344.68281 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-36694-9_10 / rank
 
Normal rank
Property / published in
 
Property / published in: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / publication date
 
19 March 2013
Timestamp+2013-03-19T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 19 March 2013 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6146540 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2105773506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achieving anonymity via clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dependent LP-Rounding Approach for the k-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fault-tolerant capacitated \(K\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for the Weighted k-Center Problem on a Real Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric <i>k</i> -center is log <sup>*</sup> <i>n</i> -hard to approximate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck extrema / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Norms and All-L_p-Norms Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the maximum intercluster distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for Multi-Budgeted Independence Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Budgeted Red-Blue Median and Its Generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Heuristic for the <i>k</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault tolerant \(K\)-center problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Approximation Results for Resource Replication Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-monotone submodular maximization under matroid and knapsack constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering with Diversity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal algorithm for the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular function maximization via the multilinear relaxation and contention resolution schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743495 / rank
 
Normal rank

Revision as of 05:31, 12 July 2024

scientific article; zbMATH DE number 6146540
  • Matroid and Knapsack Center Problems
Language Label Description Also known as
English
Matroid and knapsack center problems
scientific article; zbMATH DE number 6146540
  • Matroid and Knapsack Center Problems

Statements

Matroid and knapsack center problems (English)
0 references
Matroid and Knapsack Center Problems (English)
0 references
0 references
0 references
0 references
0 references
28 June 2016
0 references
19 March 2013
0 references
\(k\)-center
0 references
\(k\)-median
0 references
fault-tolerance
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references